Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

318 results about "Sign bit" patented technology

In computer science, the sign bit is a bit in a signed number representation that indicates the sign of a number. Although only signed numeric data types have a sign bit, it is invariably located in the most significant bit position, so the term may be used interchangeably with "most significant bit" in some contexts.

Operation method, processor, and computing device

PCT designated stage expiredWO2024244476A1Digital data processing detailsComputer hardwareSign bit
Embodiments disclosed in the present application relate to the technical field of computing, and in particular to an operation method, a processor, and a computing device. The method is executed by a processor comprising a data transfer unit and a data operation unit, and comprises: the data transfer unit acquiring an activation vector and a quantized weight vector in an AI model, the weight vector being an integer, and the activation vector being a floating point number; the data transfer unit inputting to the data operation unit a sign bit and a mantissa bit of each element in the weight vector as a sign bit and a mantissa bit of the floating point number having an index of 0, and inputting each element in the activation vector to the data operation unit; the data operation unit performing a vector operation on the inputted weight vector and activation vector, to obtain an operation result. Using the present application, operations can be performed on an integer number and a floating point number in the data operation unit. Thus, when an AI model is quantitatively compressed, it is possible to only compress the weight data, and the impact of quantitative compression on the precision of the AI model can be reduced.
Owner:HUAWEI TECH CO LTD

Analog-to-Digital Converter (ADC) with Reference ADC Path Receiving Attenuated Input to Generate Error Codes for Second and Third Harmonics by Counting Negative and Positive Codes

An interleaved Analog-to-Digital Converter (ADC) has a reference channel receiving an attenuated analog input. The reference channel is also calibrated to remove capacitor-ratio mismatch, static, and dynamic mismatches and produces a linear replica of the data channels with negligible nonlinear errors due to attenuation. Nonlinear errors on the data channels are corrected by Harmonic Distortion HD2 and HD3 coefficients. A counter increments when the sign bit of a nonlinear-corrected channel code is negative. The count is doubled and reduced by a number of samples to generate a HD2 cost function that adjusts the HD2 coefficient in a LMS loop. A HD3 correlation is generated by multiplying the reference channel output by its difference with the nonlinear-corrected channel code. The sign of the correlation code increments a second counter which generates a HD3 cost function whose sign bit adjusts the HD3 coefficient. These 2 counters generate cost functions, eliminating sample storage.
Owner:CAELUS TECH LTD

Four-bit training for machine learning

An apparatus includes a floating-point gradient register; an integer register; a memory bank; and an array of processing units. Each of the units includes a plurality of binary shifters having an integer input configured to obtain corresponding bits of a 4-bit integer multiplicand, and a shift-specifying input configured to obtain corresponding bits in an exponent field of a 4-bit floating point multiplier. The multiplier is specified in a mantissaless four-bit floating point format including a sign bit, three exponent bits, and no mantissa bits. An adder tree has a plurality of inputs coupled to outputs of the plurality of shifters, and a rounder has an input coupled to an output of the adder tree. The integer inputs are connected to the integer register; the shift-specifying inputs are connected to the floating-point gradient register; and outputs of the rounders are coupled to the memory bank.
Owner:INTERNATIONAL BUSINESS MACHINE CORPORATION

Non-linear activation function rapid calculation device and method based on coefficient lookup table

The invention provides a nonlinear activation function rapid calculation device and method based on a coefficient lookup table, and the device comprises an input selection unit which is used for selecting an input floating-point number; the coefficient lookup table unit is used for dividing the whole region of the activation function into a plurality of intervals and dividing a non-infinite interval into a plurality of sections; carrying out approximation on each section by using a quadratic function so as to establish a coefficient lookup table; the preprocessing unit is used for performing feature extraction on the floating-point number to obtain a sign bit, an order code and a mantissa; the operation unit is used for calculating an index value and a second mantissa subsegment; obtaining a corresponding quadratic function coefficient in a coefficient lookup table according to the index value; obtaining a value of a quadratic polynomial based on the second mantissa sub-segment, a corresponding quadratic function coefficient and fixed-point number multiplication and addition operation; and the post-processing output unit is used for normalizing the value of the quadratic polynomial and outputting a value in a floating-point number format in combination with the sign bit and the order code of the floating-point number, so that the problem that the calculation speed of the activation function is relatively low is solved.
Owner:NANJING UNIV

Enhanced code rate reduction for probabilistic constellation shaping in wireless communications

This disclosure describes systems, methods, and devices for probabilistic constellation shaping in wireless transmissions may include a device configured to generate, using a first quadrature amplitude modulation (QAM) order shaping encoder associated with a first code rate, shaped amplitude bits; generate, using a forward error correcting (FEC) encoder and a second code rate smaller than the first code rate, parity bits for the shaped amplitude bits; cause to transmit, using a channel, a first portion of the parity bits as sign bits for the shaped amplitude bits; and cause to transmit, using the channel, a second portion of the parity bits.
Owner:INTEL CORP

Extended floating-point range processors, methods, systems, and instructions

A processor of an aspect includes decoder circuitry to decode an instruction indicating a source floating-point operand, having a floating-point data element, and indicating a destination register. The element has a sign bit, an N-bit first exponent value, and M bits. Execution circuitry of the processor is to interpret the M bits as an M-bit significand, when the N-bit first exponent value is not all zeroes or all ones, and interpret the M bits as including a second exponent value in at least one of the M bits, and a less than M-bit significand in at least one other of the M bits, when the N-bit first exponent value is either all zeroes or all ones. The execution unit is to perform an operation on the source floating-point operand to generate a result floating-point operand, and to store the result floating-point operand in the destination register.
Owner:ALTERA CORP

Neural network circuitry having floating point format with asymmetric range

An apparatus includes circuitry for a neural network that is configured to perform forward propagation neural network operations on floating point numbers having a first n-bit floating point format. The first n-bit floating point format has a configuration consisting of a sign bit, m exponent bits and p mantissa bits where m is greater than p. The circuitry is further configured to perform backward propagation neural network operations on floating point numbers having a second n-bit floating point format that is different than the first n-bit floating point format. The second n-bit floating point format has a configuration consisting of a sign bit, q exponent bits and r mantissa bits where q is greater than m and r is less than p.
Owner:INTERNATIONAL BUSINESS MACHINE CORPORATION

Floating-point number operation method and device

The embodiment of the invention relates to the field of data processing, and discloses a floating-point number operation method and device. According to the method, a difference absolute value of order digits of two floating-point numbers is utilized to perform order alignment on a small mantissa, and a mantissa operation type system signal and a final calculation result sign bit are obtained through sign bit processing operation; if the mantissa operation type system signal indicates to perform negation operation, performing unsigned fixed-point full addition operation by using the large mantissa and the small mantissa subjected to negation operation; performing normalization shift operation on the result of the unsigned fixed-point full addition operation through the leading zero number and the shift remainder of the result of the unsigned fixed-point full addition operation, and performing overflow judgment and result normalization processing on the normalization result by utilizing an index adjustment result and a final calculation result sign bit. In this way, most of the operation logic of original code and complement conversion is omitted, the calculation precision is guaranteed, meanwhile, the scale of a logic circuit is reduced, and the calculation power density is improved.
Owner:SHANGHAI JIANQI TECHNOLOGY CO LTD

CNN-oriented signed approximate multiply-add calculation unit based on error mutual compensation

The invention discloses a CNN-oriented signed approximate multiply-add calculation unit based on error mutual compensation, and belongs to the technical field of calculation, reckoning or counting. The approximate multiplication and addition calculation unit comprises a sign bit processing module, a sub multiplier module and a partial accumulation module. And the symbol processing module performs XOR operation on the symbol bits of the two input operands to obtain the symbol bit of a calculation result. The sub-multiplier module multiplies the numerical value part of the operand to obtain a partial product; wherein a precise multiplier is used when the numeric high order is multiplied by the numeric high order, and an approximate multiplier is used in other cases. The partial accumulation module uses an accurate adder at a high position and uses an approximate adder at a low position. And meanwhile, when the approximate multiplier and the approximate adder are designed, errors of the approximate multiplier and the approximate adder are mutually compensated, so that the energy efficiency of the circuit is improved, the influence of approximate calculation on the precision of the neural network is reduced, and the requirement of the neural network on calculation precision is met.
Owner:SOUTHEAST UNIV

Floating point arithmetic device and method of operating the same

A floating point arithmetic device with two floating point operands and its operation method are disclosed. The floating point arithmetic device includes an exponent subtraction circuit, an exponent calculation circuit, a mantissa calculation circuit, and a conversion circuit. The exponent subtraction circuit calculates the difference between the exponents of the two operands and generates a sign bit and an exponent difference. The exponent calculation circuit generates the post-operation exponent bits according to the larger one of the exponents of the two operands. The mantissa calculation circuit aligns the mantissa bits of the two operands and performs one of addition and subtraction on the aligned mantissa bits. To improve the calculation efficiency and reduce the power consumption, the floating point arithmetic device can complete the floating point addition or subtraction operation in one step (one clock cycle) without moving the intermediate floating point data between the registers and the functional circuit units as in the multi-step operation.
Owner:XINLIJIA INTEGRATED CIRCUIT (SHANGHAI) CO LTD

Operating method and arithmetic unit based on Point data format

The invention relates to the technical field of artificial intelligence, in particular to an operation method and an arithmetic unit based on a Point data format.The method comprises the steps that sign bits, exponential expansion bits, mantissa bits and exponential bits of the Point data format are obtained, all the positions of the Point data format are preprocessed, a bit width distribution priority rule is defined, and a bit width distribution priority rule is obtained; multiplying the two mantissa bits obtained by decoding to obtain a mantissa product and a mask sequence; determining a prepositive zero number of the mantissa product according to the mask sequence, and performing unified logic shift on the mantissa product; the method comprises the following steps: carrying out shift on a mantissa part, carrying out rounding operation on the shifted mantissa part, converting a mantissa product into a fixed-point number format according to a sign bit, an exponential expansion bit and an exponential bit, carrying out additive operation based on the fixed-point number, and outputting an accumulation result. The circuit area and power consumption are reduced, complex time sequence control is not needed, and logic resource consumption is reduced.
Owner:OCEAN UNIV OF CHINA

Variable-precision parallelization index floating-point number storage and calculation integrated method based on FPGA

The invention belongs to the field of computers, and discloses a variable-precision parallelization index floating point number storage and calculation integrated method based on an FPGA (Field Programmable Gate Array), which specifically comprises the following steps of: inputting decimal floating point data; an index floating-point number binary sequence format is defined, decimal floating-point data values are converted into the index floating-point number binary sequence format, parameters of the index floating-point number binary sequence format comprise sign bits, index bits, mantissa bits, specified index offset and mantissa bit width, and the mantissa bit width is dynamically adjusted according to calculation requirements; based on decimal floating point data numerical values, extracting parameters of an index floating point number binary sequence, and storing the parameters in a register of the FPGA as operands; performing displacement sorting on the two operands stored in the register, and calculating an absolute value of a difference between exponent bits and a difference between mantissa bits of the two operands; the problems that in the prior art, a floating-point number storage scheme is low in calculation efficiency and insufficient in precision in an application scene where the dynamic range changes drastically are solved.
Owner:SOUTHEAST UNIV

STORING FLOATING-POINT VALUES ACCORDING TO AN EXTENDED QFLOAT FLOATING-POINT (xqFP) FORMAT IN PROCESSOR DEVICES

Storing floating-point values according to an extended QFloat floating-point (xqFP) format in processor devices is disclosed herein. In some aspects, a processor device comprises a register file comprising a plurality of registers, and comprises a floating-point unit (FPU) circuit that is configured to store a first floating-point value in a register of the plurality of registers. The first floating-point value is formatted according to the xqFP format that comprises an exponent field and a significand field. The significand field is formatted as a signed one's complement value, and comprises a sign bit, an explicit most-significant-bit (MSB), a fractional field, and a deferred increment bit that represents a value of one-half (½) unit of least precision (ULP).
Owner:QUALCOMM INC

Multi-precision floating point fusion multiply-add structure and microprocessor architecture

The invention provides a multi-precision floating point fusion multiply-add structure and a microprocessor architecture, and the structure is characterized in that in a first-stage assembly line, an input preprocessing module decomposes an input operand to obtain a sign bit, an index bit and a mantissa bit; the Booth encoder generates partial products through a radix-4 Booth encoding algorithm, and the tree array multiplier compresses the partial products into three groups; in the second-stage assembly line, the CSA4-2 compression adder compresses the mantissa bits after the three groups of partial products and shift alignment into two groups; the summator module sums the two groups of partial products to obtain a mantissa summation result; in the third-stage assembly line package, a leading zero detection module performs leading zero detection on the mantissa summation result, and performs index adjustment and mantissa adjustment to obtain a normalized result; and in the fourth-stage assembly line, rounding of floating point data is carried out. According to the application, the operation performance, the energy efficiency ratio and the adaptability of the floating point fusion multiply-add structure are improved, so that the high performance and the high energy efficiency of the microprocessor are balanced.
Owner:EHIWAY MICROELECTRONIC SCI & TECH (SUZHOU) CO LTD

Multiplication device

A multiplication apparatus includes: a sign calculator adapted to determine a sign bit of a target product based on a sign bit of a first value and a sign bit of a second value; the first value and the second value are floating-point numbers; the compensator is suitable for determining an index flag bit and a first compensation value based on the mantissa bit of the first value and the mantissa bit of the second value; an exponent calculator adapted to determine a first exponent bit based on the exponent bit of the first value and the exponent bit of the second value; determining an index bit of the target product based on the first index bit and the index flag bit; a mantissa calculator adapted to determine a first mantissa bit based on the mantissa bit of the first value and the mantissa bit of the second value; and based on the first mantissa digit and the first compensation value, determining the mantissa digit of the target product, and finally obtaining the target product. According to the scheme, floating-point number multiplication can be converted into floating-point number addition, good approximation precision is achieved, and the area and power consumption of a calculation unit can be reduced.
Owner:SHANGHAI FUDAN MICROELECTRONICS GROUP

Method for optimizing ECC (Error Correction Code) protection strength of NAND FLASH in-memory computing system for LLM inference chip

The invention discloses a method for optimizing ECC (Error Correction Code) protection strength of an NAND FLASH in-memory computing system for an LLM inference chip, and belongs to the technical field of computing, reckoning or counting. Based on an NAND FLASH in-memory computing architecture, the invention provides a self-adaptive sub-plane protection strategy based on a Hamming code, and an error sensitivity grading model of sign bits, index bits and mantissa bits is established by analyzing BF16 numerical value distribution characteristics of large language model weight data; in combination with a residual connection structure of a Transform decoding layer, inter-layer cosine similarity is calculated to evaluate layer importance; and dynamically adjusting the Hamming code protection granularity by adopting a greedy algorithm, and carrying out iterative optimization according to a simulation error injection result until the model confusion degree and the accuracy meet threshold values. And performing ECC software and hardware collaborative design according to an iteration result of the greedy algorithm to obtain an ECC circuit required to be configured by each plane of the NAND flash memory. According to the method, the circuit area power consumption is remarkably reduced while the model reasoning precision is ensured, the ECC bandwidth requirement is reduced, and the large model reasoning efficiency and reliability are remarkably improved.
Owner:SOUTHEAST UNIV

Self-adaptive information source channel coding system for task-oriented semantic communication

The invention relates to a task-oriented semantic communication-oriented adaptive source channel coding system, which belongs to the field of wireless communication, and comprises a sending end for extracting a semantic feature map for evaluation from input data through a feature extractor initialized based on a pre-training large model, executing nested quantization and arithmetic coding based on a calculated importance score, and sending the semantic feature map to a task-oriented semantic communication-oriented adaptive source channel coding system; generating a scalable semantic bit stream with importance levels; the physical layer is used for carrying out reordering and grouping according to importance levels of bit streams, a channel encoder is combined with an interleaver to realize unequal error protection of semantic matching, and encoded bits are mapped to sign bits with different fault-tolerant capabilities in a constellation diagram through division modulation; and a receiving end: recovering the semantic feature map through arithmetic decoding and nested inverse quantization. According to the invention, on the premise of keeping compatibility with a digital communication protocol stack, through distortion-driven joint rate self-adaption, the transmission effectiveness for machine tasks and human vision is obviously improved under a limited bandwidth.
Owner:UESTC (SHENZHEN) ADVANCED RES INST

Method and system for rounding a subnormal number

A method of rounding a floating-point number in an Extended Exponent Range, herein "EER", that would be a denormal floating-point number represented in an Unextended Exponent Range, herein "UER" is disclosed. The method may comprise the steps of receiving, at an arithmetic unit, a plurality of input numbers in the EER representation, each input number comprising a sign bit (si), exponent bits (ei) and mantissa bits (mi); performing an arithmetic operation to produce an output number in the EER representation comprising a sign bit (sa), an exponent bits (ea) and mantissa bits (ma); constructing a rounding mask based on the exponent bits (ea) computed by the arithmetic operation; and applying the rounding mask to the output number in the EER representation to round the output number to correct position as if rounding in the UER representation.
Owner:IMAGINATION TECH LTD

Circuit for approximate floating point fusion dot product operation

The invention discloses a circuit for approximate floating point fusion dot product operation. The circuit comprises an extraction module used for extracting sign bits, mantissa bits and exponent bits from four single-precision floating point numbers; the symbol integration module is used for integrating symbol bits and correcting mantissa bits; the index comparison module is used for calculating two groups of dot product effective indexes according to the index bits and generating three control quantities; the first multiplication module is used for generating a first group of approximate partial products according to a correction mantissa digit corresponding to a first control quantity larger value; the second multiplication module is used for generating a second group of approximate partial products according to the correction mantissa digit corresponding to the smaller value of the first control quantity, and performing arithmetic displacement and adding symbol compensation bits according to the size of the second control quantity; the fusion compression module is used for performing fusion compression on the first group of approximate partial products, the second group of approximate partial products after arithmetic shift and the symbol compensation bits to obtain a sum sequence and a carry sequence; and the result output module is used for generating a dot product operation result in combination with the third control quantity.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Low-delay linear interpolation accelerator integrated with pre-processing module and method

The invention discloses a low-delay linear interpolation accelerator integrated with a pre-processing module and a method, the low-delay linear interpolation accelerator is composed of an input module, a front-end processing module, a symbol expansion module, a linear interpolation calculation module and an output module, and the input module is used for data input; the front-end processing module comprises a butterfly network channel and an anti-butterfly network channel, and the butterfly network channel and the anti-butterfly network channel are used for bidirectional cyclic shift, bit aggregation and bit dispersion; the symbol expansion module is used for expanding symbol bits of the data; and the linear interpolation calculation module is used for calculating the interpolation of the corresponding interpolation proportion. Under the same combinatorial logic hardware consumption, the bidirectional cyclic shift, bit aggregation and bit dispersion functions can be realized by using an inverse butterfly network structure and a butterfly network structure, the circuit can also be well transplanted to a module with a higher bit width and can be applied to other functions, and meanwhile, a pre-processing module can work independently of an interpolator.
Owner:NANJING WUJIAN TECH CO LTD

Operation method, processor and computing device

The embodiment of the invention belongs to the technical field of computing, and particularly relates to an operation method, a processor and computing equipment. The method is executed by a processor comprising a data carrying unit and a data operation unit, and comprises the following steps: the data carrying unit obtains an activation vector in an AI model and a quantized weight vector, the weight vector is an integer number, and the activation vector is a floating-point number; and the data carrying unit inputs the sign bit and the mantissa bit of each element in the weight vector as the sign bit and the mantissa bit of the floating-point number with the index of 0 into the data operation unit, and inputs each element in the activation vector into the data operation unit. And the data operation unit performs vector operation on the input weight vector and the activation vector to obtain an operation result. By adopting the method and the device, the operation of the integer number and the floating-point number can be realized in the data operation unit, so that when the quantitative compression is performed on the AI model, only the weight data can be compressed, and the influence of the quantitative compression on the precision of the AI model can be reduced.
Owner:HUAWEI TECH CO LTD

Performing floating-point operations using an expanded-range floating-point format in processor devices

Performing floating-point operations using an expanded-range floating-point format in processor devices is disclosed herein. In some aspects, a processor device comprises a floating-point unit (FPU) that is configured to perform a floating-point operation using one or more floating-point values interpreted by the FPU according to an expanded-range floating-point format that comprises no sign bit, a plurality of exponent bits including an additional exponent bit relative to a corresponding standard floating-point format, and a plurality of significand bits. The expanded-range floating-point format comprises a same number of bits as the corresponding standard floating-point format. A count of the plurality of significand bits of the expanded-range floating-point format is identical to a count of a plurality of significand bits of the corresponding standard floating-point format, and the significand bits of the expanded-range floating-point format are interpreted in a manner identical to the significand bits of the corresponding standard floating-point format.
Owner:QUALCOMM INC

Coded modulation in communications

Disclosed is a method comprising, by a transmitter apparatus, partitioning (901) an input data stream to obtain a bit stream X1 and a bit stream X2; subjecting (902) the bit stream X2 to encoding by LDPC encoders, to obtain X2 parity bits, and X2 information bits; applying (903) SPC encoding to the X2 parity bits, together with the bit stream X1, to obtain sign bits, wherein the bit stream X1 is used as padding bits; subjecting (904) the sign bits, the padding bits, and the X2 information bits, to an interleaver operation to obtain an interleaver output; subjecting (905) the interleaver output to Gray mapping to form multiple consecutive quadratic amplitude modulation, QAM, symbols; modulating (905) the QAM symbols by quadratic amplitude modulation to obtain a modulated data stream; and transmitting (906) the modulated data stream via a radio access network or optical fibre communication network.
Owner:NOKIA SOLUTIONS & NETWORKS OY

Multiplier, multiply-accumulate circuit, operational circuit, processor, and computing device

Provided are a multiplier, a multiply-accumulate circuit, an operational circuit, a processor, and a computing device. The operational circuit comprises an input processing circuit (200) and a multiply-accumulate circuit (100). The input processing circuit (200) receives a first number, if the first number is a signed number, negates a sign bit of the first number and then outputs the first number as a first multiplicator for feeding into the multiply-accumulate circuit (100), and if the first number is an unsigned number, directly outputs the first number as the first multiplicator for feeding into the multiply-accumulate circuit (100). The input processing circuit (200) further receives a pre-known second number and directly outputs the second number as a second multiplicator for feeding into the multiply-accumulate circuit (100). The multiply-accumulate circuit (100) comprises a multiply sub-circuit (111) and an accumulate sub-circuit (112). The multiply sub-circuit (111) comprises a multiplier for performing multiplication of the first multiplicator and the second multiplicator and providing an unsigned output. The accumulate sub-circuit (112) receives and accumulates the output of the multiply sub-circuit.
Owner:SHENZHEN MICROBT ELECTRONICS TECH CO LTD

Deep neural network quantization method and system based on beta divergence and soft approximation mapping

The invention discloses a deep neural network quantization method and system based on beta divergence and soft approximation mapping. According to the method, dynamic distribution statistics is carried out on input data of each batch of a network to obtain data distribution information, AIC is introduced to serve as an evaluation index of distribution goodness of fit, optimal fitting distribution is dynamically selected from multiple distribution models such as normal distribution models, Laplace distribution models and generalized Gaussian distribution models, and the optimal quantization interval is accurately determined; and then constructing a derivable soft rounding approximation function, designing a dynamic slope adjustment mechanism, and adaptively adjusting a slope parameter of a mapping function according to the variance activated and output of each layer, so that the mapping function realizes dynamic balance of quantization and precision in different distribution states. After network training is completed, original floating point number weights are recorded, symmetric quantization is performed to obtain 8-bit integer weights with sign bits, the difference of weight distribution before and after quantization is measured by using improved beta divergence, and quantization weights are guided to approach original floating point weight distribution in a retraining stage, so that quantization errors are reduced.
Owner:SHANGHAI JIAOTONG UNIV +1

Floating point multiplier-adder, processor and electronic equipment

The invention provides a floating point multiplier-adder, a processor and electronic equipment. The floating point multiplier-adder comprises a control module, a receiving module, a splitting module, an index operation module, a multiplication module, an order matching module and an addition module. The receiving module receives all of the first, second and third operands or only the first and third operands for operation. The splitting module splits the operands received by the receiving module into sign bits, indexes and mantissas. The addition module performs first addition processing on the order result and the multiplication operation result based on the mantissa when the multiplication operation is performed, or performs second addition processing on the order result and the first mantissa of the first operand based on the mantissa when the addition operation is performed. The control module controls the splitting module, the index operation module, the addition module and the multiplication array module according to operation types. The floating-point multiply-add device can reduce power consumption loss when the floating-point multiply-add device executes additive operation.
Owner:HYGON INFORMATION TECH CO LTD

Floating point multiplier based on FPGA (Field Programmable Gate Array), calculation method and equipment

The invention relates to the field of floating-point multiplication, and particularly discloses a floating-point multiplier based on an FPGA, a calculation method and equipment, and the floating-point multiplier comprises a symbol calculation module which is used for determining the symbol of a target output floating-point number through an exclusive-OR gate and the symbol bits of a first input floating-point number and a second input floating-point number; the index addition module is used for adding the indexes of the first input floating-point number and the second input floating-point number and subtracting the deviation value of the corresponding format to obtain the index output of the target output floating-point number; the binary multiplier module is used for carrying out multiplication operation by using a Karatsuba algorithm and a Urdhva-Tiryagbhyam algorithm based on the mantissa bit widths of the first input floating-point number and the second input floating-point number so as to obtain a mantissa product of the target output floating-point number; and the result normalization module is used for performing normalization operation based on the mantissa product. The calculation delay can be reduced, and the percentage increase of the hardware area is also reduced.
Owner:SHANDONG INSPUR SCI RES INST CO LTD

Matrix multiplier and operation method of matrix multiply device including the same

A matrix multiplier includes an input vector scaler generating a first quantization scaled input vector based on a first input vector, a plurality of common scale coefficients, and first-to-Rth multiplication scale coefficients, a first data type converter generating a first fixed point quantization scaled input vector based on the first quantization scaled input vector, an element array comprising a first processing element generating a first fixed point output element based on the first fixed point quantization scaled input vector and first plurality of quantization sign bits, and a second processing element generating a second fixed point output element based on the first fixed point quantization scaled input vector and second plurality of quantization sign bits, and a second data type converter generating and outputting first and second output elements by converting data types of the first and second fixed point output elements.
Owner:SAMSUNG ELECTRONICS CO LTD +1

A tensor computation method and related apparatus

This application provides a tensor computation method and related apparatus. Through this method, a unified preprocessing is used to obtain the corresponding sign bit, exponent part, and mantissa part for tensors of different data types. Then, through subsequent general exponent accumulation, mantissa multiplication, comparison, shifting, and addition processing, the above unified processing logic can be adapted to the computational needs of different data tensors. Compared with the design idea of ​​equipping each data type with dedicated integrated circuits, this fundamentally eliminates circuit redundancy, thereby reducing chip area, reducing power consumption, and improving flexibility.
Owner:BEIJING AIJIE KEXIN TECHNOLOGY CO LTD

Approximate precoding convolution operation method and system based on booth algorithm

The application provides a kind of approximate precoding convolution operation method and system based on booth algorithm, comprising: step S1: multiplier and multiplicand input multiplier are separated by approximate precoding module to partial product, and the partial product related to the multiplicand after separation is input to addition tree module to complete compression, and the partial product related to the multiplicand after compression and the partial product related to the multiplier are added to obtain multiplier result;Step S2: the multiplier result is extended to sign bit, and the extended multiplier result is input into accumulation module to carry out shift and addition operation, and the shift addition operation result is carried out carry compensation.
Owner:SHANGHAI JIAOTONG UNIV