1110 results about "Floating point" patented technology

The invention discloses a processor and electronic equipment. The processor includes a computing unit including a tensor core configured to perform a matrix multiplication operation using a scaling factor, and a memory, the computing unit further including a scaling factor processing module configured to determine and cache a scaling factor for each tensor associated with the matrix multiplication operation, the computing unit further comprises at least one storage module arranged on a data path between the tensor core and the memory, and the at least one storage module is exclusively occupied by the tensor core when the tensor core executes tensor related operation. And the scaling factor processing module is arranged on the at least one storage module. At present, scaling factors and floating-point number quantization are completed by a vector calculation core, so that performance is reduced, and delay becomes high, and a scaling factor processing module arranged on a storage module in a calculation unit can improve the overall execution efficiency of low-precision matrix multiplication using the scaling factors.

The invention discloses a single-epoch GNSS-oriented PAR ambiguity precision factor determination method, and relates to the technical field of satellite navigation and positioning. Comprising the following steps: dividing pseudo-range and carrier wave observed quantities in a GNSS double-difference mathematical model into two groups, and constructing a function relationship between a floating point solution # imgabs1 # and a floating point solution # imgabs2 # variance-covariance matrix of an ambiguity vector # imgabs0 #; constructing a single-frequency single-epoch single-system P-ADOP expression and establishing a shrinkage factor k de-inversion transformation analytic expression, and simultaneously obtaining a single-frequency single-epoch single-system GNSS non-inverse transformation P-ADOP approximation formula; and performing analogy derivation on the single-frequency single-epoch single-system non-inverse transformation P-ADOP approximate formula to obtain a single-frequency multi-system or multi-frequency single-epoch GNSS non-inverse transformation P-ADOP general approximate formula. The method has important theoretical value and practical guiding significance for GNSS optimal ambiguity subset rapid selection and positioning and partial ambiguity fixing success rate influence mechanism analysis.

The invention provides a frequency difference compressor based on precision perception, a gradient compression method, equipment and a medium, which are used for carrying out data compression and transmission between a server and a client so as to reduce communication overhead in personalized federated learning, and relates to the technical field of data compression. The frequency difference compressor comprises an information bottleneck rarefaction unit, a frequency domain compression unit, a dynamic quantization unit and a differential coding unit. Non-key gradient redundant components of the original gradient data are removed through an information bottleneck rarefaction unit to generate sparse gradient data; generating a metadata packet containing the first N high-energy frequency domain coefficients and the positions and the number of the first N high-energy frequency domain coefficients through a frequency domain compression unit; performing adaptive bit width mapping on the high-precision floating point gradient data into low-order integer representation through a dynamic quantization unit to generate dynamic quantization gradient data; and the differential gradient is transmitted to the client through the differential coding unit, so that data compression and transmission are completed. The method solves the problems that the communication overhead is large and gradient information cannot be reserved as far as possible in gradient transmission.

The invention provides a mixed data precision matrix multiplication and addition unit and a calculation method, the matrix multiplication and addition unit comprises a calculation unit, and the calculation unit comprises a format division module, a multiplication array module, an addition tree module, an accumulator module, a normalization module and a shift register module. The calculation unit converts the first input matrix and the second input matrix into input data in a middle floating point format; executing parallel multiplication operation on the input data to generate an intermediate product result; performing index alignment and accumulation on the intermediate product result to generate an intermediate accumulated value; accumulating the intermediate product result and the value of the third input matrix in a form of accumulating an intermediate accumulated value, and outputting an accumulated result; and converting an accumulation result into a normalized result and outputting the normalized result. The format division module supports various precisions and converts data with different widths into an intermediate floating point format, so that other hardware units can be reused, and the problems that hardware resources are complex and different model reasoning scenes are difficult to meet are solved.

Approaches for compressing exponents of floating point values include accumulating a distribution of values of exponents of the first set of floating point values, and compressing the exponents of the first set of floating point values into a compressed exponent bit-width as a function of a compressed exponent bias. The compressed exponent bit-width and the compressed exponent bias are adjusted based on the distribution of values of exponents of the first set of floating point values. The distribution of values of exponents of the first set of floating point values is accumulated with values of exponents of a second set of floating point values that is input in subsequent time period. The exponents of second set of floating point values are compressed into the compressed exponent bit-width as a function of the compressed exponent bias after the adjusting of the compressed exponent bit-width and the compressed exponent bias.

Vector-scaled hierarchical codebook quantization reduces precision (bitwidth) vectors of parameters and may enable energy-efficient acceleration of deep neural networks. A vector (block array) comprises one or more parameters within a single dimension of a multi-dimensional tensor (or kernel). For example, block array comprises 4 sub-vectors (blocks) and each sub-vector comprises 8 parameters. The parameters may be represented in integer, floating-point, or any other suitable format. A vector cluster quantization technique is used to quantize blocks of parameters in real-time. Hardware circuitry within a datapath identifies an optimal codebook of a plurality of codebooks for quantizing each block of parameters and the block is encoded using the identified codebook. During processing, the identified codebook is used to obtain the quantized parameter and perform computations at the reduced precision.

The invention discloses a tensor core, a processor, a data processing method, electronic equipment and a storage medium, and is applied to the field of tensor processing. The tensor kernel comprises a first dot multiplication unit and a scaling factor matrix multiplication processing module, the scaling factor matrix multiplication processing module comprises a second dot multiplication unit, and the first dot multiplication unit and the second dot multiplication unit support dot multiplication operations of different floating-point number precisions. The tensor core is configured to receive a first tensor, a second tensor, a scaling factor of the first tensor, a scaling factor of the second tensor, an offset term of the first tensor, and an offset term of the second tensor, perform a matrix multiplication operation using the scaling factor and the offset term using a first dot multiplication unit and a scaling factor matrix multiplication processing module, and obtaining a matrix multiplication operation result of the first tensor and the second tensor. Matrix multiplication operation using scaling factors is executed by multiplexing dot multiplication units with different precisions in a tensor kernel, extra hardware area cost is reduced, and existing hardware resources are fully multiplexed.

The invention discloses a picture occlusion relation processing method and device and a storage medium, and relates to the technical field of rendering, and the method comprises the steps: determining a vertical distance between a target element in a to-be-rendered frame and a preset base point; performing normalization processing on the vertical distance to generate a floating point value corresponding to each target element; encoding the floating point value to generate at least one integer channel value corresponding to the element; storing the integer channel value corresponding to the target element to vertex color information of the grid data corresponding to the target element to generate a rendering grid; and rendering the target element based on the rendering grid. According to the method, the normalized and coded depth value is borne through the vertex color information, so that the technical problem that the rendering performance is low due to the fact that the node tree needs to be traversed in each frame and massive elements need to be sorted in the prior art is solved, seamless fusion of the depth data of the rendered elements and the vertex colors is realized, and the rendering efficiency of the elements is improved.

The invention discloses a multi-dimensional collaborative AI training processor benchmark evaluation device and method. According to end-to-end performance evaluation, TTA and throughput indexes are obtained through a standardized training process; the operator support degree evaluation adopts a dynamic parameter generation technology to evaluate the speed-up ratio and the floating point performance utilization rate of calculation-intensive and memory-access-intensive operators; the energy consumption evaluation calculates a power consumption delay product based on steady-state power consumption monitoring. And finally, integrating multi-dimensional indexes through an analytic hierarchy process model and a fuzzy theory, realizing level mapping by adopting a four-section membership function, and finishing multi-level aggregation evaluation in combination with matrix operation. According to the method, three dimensions of performance, operator support degree and energy efficiency are creatively integrated, the problems of single evaluation index and high environment dependence of the heterogeneous AI processor are solved through automatic container deployment, dynamic parameter generation and steady-state power consumption monitoring technologies, and a comprehensive and quantifiable evaluation basis is provided for processor model selection.

A method for performing a computing task includes: extracting one or more features from a user content; converting the features to a floating point query vector; quantizing the floating point query vector; obtaining a database vector including one or more floating point feature vectors; determining a compensation vector based on a data distribution of the floating point query vector; quantizing the floating point feature vectors; determining an error function based on a difference between data distributions of i) the quantized query vector compensated with the compensation vector, and ii) the floating point query vector; determining, based on the error function, values of the compensation vector corresponding to the quantized feature vectors; combining the quantized query vectors and the values of the compensation vector to obtain one or more compensated query vectors; and performing the computing task using the compensated query vectors and the quantized feature vectors to obtain an output.

A model compression method includes obtaining a first weight of each layer of a neural network model, where the first weight of each layer is a value of a floating-point type; and quantizing the first weight of each layer based on a quantization parameter to obtain a second weight of each layer. The second weight of each layer is a multi-bit integer. Quantities of bits of second weights of at least a part of layers are different. A quantity of quantization bits of a second weight of a layer with high sensitivity to a quantization error is greater than a quantity of quantization bits of a second weight of a layer with low sensitivity to the quantization error.

A device for decoding encoded dynamic mesh data determines a set of quantized integer coefficient values for displacement vectors of the encoded dynamic mesh data; determines a quantization parameter based on one or more syntax elements included in a displacement sub-bitstream of the encoded dynamic mesh data; inverse quantizes, based on the quantization parameter, the set of quantized integer coefficient values to determine a set of fixed-point dequantized coefficient values; determines a set of fixed-point transformed coefficient values based on the set of fixed-point dequantized coefficient values; converts the set of fixed-point transformed coefficient values to a set of floating-point transformed coefficient values; inverse transforms the set of floating-point transformed coefficient values to determine a set of reconstructed displacement vectors; and determines a reconstructed deformed mesh based on the set of reconstructed displacement vectors.

Disclosed in the present application are a data processing method based on a large language model, and a large language model, an electronic device, a computer-readable storage medium and a computer program product. The method is applied to a user terminal, wherein a large language model is deployed on the user terminal, and weight parameters of linear calculation layers of the large language model are pre-quantized into format data of an integer data type. The method comprises: acquiring input data; performing vector conversion on the input data by means of an embedding layer of a large language model, so as to obtain a floating-point query vector of a floating-point data type corresponding to the input data; converting the floating-point query vector into an integer query vector of an integer data type; and performing an operation by means of weight parameters of linear calculation layers and the integer query vector, so as to obtain a query result corresponding to the input data. By means of the solution provided in the present application, a large language model can be smoothly run on a user terminal, such that the user terminal can provide services for users without needing network connectivity, and can better ensure the privacy of the users.

The invention provides a BLAS3 structured operator accelerated computing system based on a Hopper architecture GPU, and relates to the technical field of computers. The system comprises: a calculation unit discrimination module for determining a calculation unit used by a current operator during operation, and estimating the maximum row dimension upper bound of the current operator in a tensor core execution path; an instruction sensing block parameter determination module dynamically determines the optimal block size and number of the input matrix in real time; the block matrix loading and aligning module divides an input matrix and a matrix to be updated into sub-matrixes by taking the block size as a basic block and completes loading of the corresponding sub-matrixes; the operator kernel function execution module completes shared memory structured parallel loading and storage of a double-precision floating-point number array of a sub-matrix corresponding to the input matrix, and calls a tensor core to carry out multiply-add accumulation calculation; and the assembly line and concurrent scheduling module adds the block calculation tasks into corresponding task sets and performs multi-stream concurrent scheduling on the task sets.

A method and an apparatus for storing data points are provided. The method comprises: receiving the plurality of data points, each data point of the plurality of data points being represented in a floating-point representation; quantizing each one of the first plurality of data points, by: executing, during a first quantization phase: converting each data point of the plurality of data points into a corresponding first data point of a plurality of first data points; executing, during a second quantization phase: applying, to each first data point of the plurality of first data points a clamping function, thereby converting each first data point of the plurality of first data points into a corresponding second data point of a plurality of second data points; and storing the plurality of second points for further calculations instead of the first plurality of data points.

The invention belongs to the technical field of storage and calculation integration, and particularly relates to a low-bit-width and high-energy-efficiency floating point storage and calculation integrated circuit based on a partial pre-alignment framework. The circuit comprises a memory array, a pre-calculation unit, an adder tree, a configurable arithmetic unit and a normalization unit, and supports mixed precision operation of FP8MACFP4 and FP8MACFP8. The method is characterized in that a partial pre-alignment strategy dominated by an activation value is adopted, the maximum index of the activation value is dynamically counted, the mantissa of the maximum index is aligned, and multiple partial pre-alignment intermediate results are pre-calculated and latched for reuse; in combination with a customized lookup table and a multiplexer, a pre-calculation result is directly selected to replace real-time multiplication and displacement; and through the reconfigurable hardware, the FP8MACFP8 high-precision operation is realized by utilizing the FP8MACFP4 unit combination. According to the method, complete online floating point multiplication and addition operation is realized, and excellent energy efficiency ratio and operation speed are obtained while high precision is kept.

The invention relates to a data processing method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: acquiring input original data and a corresponding data type; under the condition that the data type is a floating point format, obtaining an index and a mantissa of the original data; according to the index, determining an integer significant digit of a fixed-point format corresponding to the original data; according to the index and the mantissa, determining mantissa significant digits of a fixed-point format corresponding to the original data; determining a fixed-point format structure corresponding to the original data according to the integer significant bit and the mantissa significant bit of the fixed-point format; converting the original data into fixed-point format data, and storing the fixed-point format data into a fixed-point format structure to obtain converted data; and under the condition that the data type of the original data is a fixed-point format or the converted data is obtained, inputting the original data and / or the converted data into the normalized exponential function to obtain target data. By adopting the method, the data processing efficiency can be improved.

An operation accelerator that performs an operation between a floating point matrix and an integer matrix includes a first buffer storing integer matrix data; a second buffer storing floating point matrix data; a data converter to convert the floating point matrix data into an integer; and an operator to perform multiplication on the integer matrix data and integer operation target matrix data output from the data converter, wherein the data converter includes a pre-aligner to find a maximum exponent value among multiple floating point values included in the floating point matrix data, perform pre-alignment for moving a mantissa of each of floating points by a difference between the maximum exponent value and an exponent value of each of the multiple floating point values, and generate the integer operation target matrix data based on mantissas of a preset number of high-order bits extracted from among mantissas of pre-aligned floating point values.

A fused dot-product multiply-accumulate (MAC) circuit may support variable precision of floating-point data elements to perform computations in deep learning operations (e.g., MAC operations). The operating mode of the circuit may be selected based on the accuracy of the input element. The mode of operation may be an FP16 mode or an FP8 mode. In the FP8 mode, a product index may be calculated based on an index of a floating point input element. A maximum index may be selected from the one or more product indexes. A global maximum index may be selected from a plurality of maximum indexes. A product mantissa may be calculated based on a difference between the global maximum exponent and a corresponding maximum exponent and aligned with another product mantissa. The adder tree may accumulate the aligned product mantissas and compute the partial and mantissas. The portions and mantissas may be normalized using a global maximum index.

The invention provides a multiply-accumulate operation method and device for extremely low precision training, and the method comprises the steps: obtaining an operated part and to-be-operated data, and the to-be-operated data comprises one or more of floating point, fixed point and logarithm data formats; if the high-precision floating-point number exists in the data to be calculated, decomposing the high-precision floating-point number into the sum of two low-precision floating-point numbers; floating-point, fixed-point and logarithm data formats in the data to be calculated are decoded to be uniform formats of symbols, indexes and mantissas, and input data in the uniform formats are generated; performing multi-term dot product on the input data with the unified format to realize combined calculation of data formats with different precision; and adding the combined calculation result and the calculated part sum by adopting an advanced random rounding method. The method can support the combined calculation among various formats, reduces the bit width of the accumulator on the premise of maintaining the precision requirement by using an advanced random rounding method, and reduces the operation cost and improves the training efficiency under extremely low precision compared with the existing operation hardware.

The invention discloses a high-density NAND storage medium self-adaptive repairing method which comprises the following steps: a main control chip separates a target feature vector representing the real aging trend of a storage unit from original read data containing random physical noise; the main control chip deduces the target feature vector by using a full-integer recursive prediction model to obtain a health state prediction result of the storage unit in a future preset time period; wherein the health state prediction result comprises an optimal read reference voltage offset and an estimated bit error rate growth curve; and the main control chip adjusts the charge distribution pattern and programming voltage parameters of the data on the storage unit in the data writing stage according to the health state prediction result. By means of the mode, the problems of firmware assembly line blocking and performance jitter caused by floating point operation and huge model parameter loading can be solved under the limited hardware environment that the main control chip only supports integer operation and on-chip cache is extremely small.

The invention discloses a finger-storage-multiply-accumulate three-stacked floating-point number in-memory computing system, and belongs to the field of application-specific integrated circuit design. According to the system, a three-stack type floating-point number calculation framework is designed, a pointing shift and mantissa multiply-accumulate module is designed, and floating-point number multiply-accumulate calculation of global pointing is supported. Compared with a traditional parallel floating-point multiply-accumulate circuit, the parallel floating-point multiply-accumulate circuit has the advantages that a calculation process of global alignment shifting and mantissa multiply-accumulate in sequence and a three-stack type calculation framework are adopted, similar calculation precision is achieved with smaller hardware overhead, low hardware overhead and high calculation precision are both considered, and the comprehensive performance of the calculation framework and the circuit is improved.

The embodiment of the invention discloses a floating point calculation device and method for a processor, electronic equipment and a storage medium, and the device comprises a mantissa alignment module which is used for carrying out the interception processing of a first mantissa of a first floating point number based on an interception digit to obtain a first addend, and carrying out the first addend based on a shift digit to obtain a second addend; the second mantissa of the second floating-point number is shifted to obtain a second addend, and the first addend and the second addend are two mantissas with aligned indexes; the interception bit number and the shift bit number are determined based on an index difference value between a first index of the first floating-point number and a second index of the second floating-point number; the adder is used for adding the first addend and the second addend to obtain a first mantissa sum; and the post-processing module is used for performing normalization processing and rounding processing on the first mantissa sum to obtain a target mantissa. Therefore, the selector processing process before the mantissa is shifted in the floating point addition calculation process can be reduced, the calculation path is shortened, and the calculation speed is improved.

The invention provides an arithmetic logic unit of a processor and a floating-point number calculation method, and belongs to the technical field of floating-point numbers. The arithmetic logic unit comprises a format conversion module and a mixed precision multiplier-adder, the format conversion module performs format conversion on a high-precision floating-point number to obtain a low-precision floating-point number, and retains an index lost in the conversion process as index auxiliary information, and when the mixed precision multiplier-adder performs multiply-add operation on the low-precision floating-point number, the mixed precision multiplier-adder performs multiply-add operation on the low-precision floating-point number. And the index auxiliary information is used for compensating the lost index, so that the precision loss of the floating-point number can be reduced when the mixed precision multiplier-adder is used.

Approaches for determining quantization scale factors include generating a population of chromosomes. Each chromosome has multiple genes, and each gene specifies a scale factor associated with a layer of a machine learning model. The population of chromosomes are evaluated, and the evaluating includes, for each chromosome in the population, quantizing floating point weights and floating point values of a representative dataset using the scale factors of the chromosome to produce quantized weights and a quantized dataset in the memory arrangement, initiating processing of the quantized dataset using the quantized weights according to the machine learning model, and gauging a level of accuracy of results produced by the processing of the quantized dataset. Satisfaction of termination criteria is determined based the levels of accuracy associated with the chromosomes in the population. The population of chromosomes is evolved and the evaluating repeated in response to the termination criteria not being satisfied.

The invention relates to a satellite navigation and positioning method and device, and belongs to the technical field of satellite navigation and positioning. Resolving the GNSS observation value based on a single-difference GNSS sliding window optimization model to obtain a floating point solution corresponding to a positioning result; the sparsity of a matrix in a graph optimization problem is ensured based on a single-difference GNSS sliding window optimization model; further, gross error detection is carried out on the GNSS observation value based on sliding window data, a test result is obtained, and the robustness of the algorithm in a complex environment is ensured; when the test result is that the test is passed, determining a single-difference ambiguity variable according to the floating point solution, and performing inter-satellite single-difference on the single-difference ambiguity variable to obtain floating point double-difference ambiguity; the floating point double-difference ambiguity is fixed based on a partial ambiguity fixing method, the satellite navigation positioning process of a GNSS fixed hold solution (Hold solution) under a graph optimization model is realized, and the precision and reliability of satellite navigation positioning are improved.

The invention relates to an integrated circuit, a processor and a computing device for data processing. The integrated circuit comprises a data storage circuit and a matrix operation circuit. The data storage circuit is configured to store matrix data. The matrix operation circuit includes: a control logic circuit configured to: read a first matrix and a second matrix from a data storage circuit based on a specified data format indicating that elements in the first matrix are floating point type data and elements in the second matrix are integer type data; and the arithmetic logic circuit is configured to convert elements in the first matrix and the second matrix into elements of a target floating point type according to the data types of the elements indicated by the specified data format, and determine result matrixes corresponding to the first matrix and the second matrix based on the converted elements of the first matrix and the second matrix. The integrated circuit is helpful for improving the matrix operation efficiency and reducing the occupation of storage space and the data transmission quantity.

The invention discloses a method for applying linear programming to CDN (Content Delivery Network) scheduling, which relates to the technical field of content delivery networks and comprises the steps of data preparation, strategy layer version smooth configuration, macroscopic layer and microscopic layer linear solution and online execution. Basic data are collected, cleaned and repaired, and a version change rule is set; the macroscopic layer constructs a linear programming model, and the cross-provincial bearing quota is solved with the aim of minimizing the cross-provincial cost; the micro layer takes the quota as a boundary and generates domain name class-node weight vectors in parallel; and adapting a routing request online through weighted rendezvous hashing and request features. According to the method, a dynamic cost matrix and a weight granularity control technology are integrated, the engineering problem of linear programming is solved, second-level response, approximate global optimal scheduling and accurate execution of floating-point-level weight are realized, memory overhead is reduced, smooth updating of a strategy and system stability are guaranteed, and CDN service quality and operation efficiency are improved.

The invention provides a weight quantification method and device based on mixed segment coding and a server, and relates to the technical field of artificial intelligence, and the method comprises the steps: obtaining a to-be-processed floating point weight and an activation value; based on the Laplacian distribution of the floating point weights, carrying out hybrid segmented coding processing on the floating point weights to obtain a coding weight set in a quantization weight coding format; and determining a multiplication coefficient and a shift value of the coding weight based on the identification bit, and carrying out multiplication and addition calculation processing on the activation value and the weight information in the data bit based on the multiplication coefficient and the shift value to obtain an output activation value corresponding to the coding weight. According to the method, the quantization precision of the neural network can be remarkably improved, and the quantization error is reduced while the compression ratio is not changed.

The embodiment of the invention discloses an inverse quantization method of model data, a matrix operation method and related equipment, and the method comprises the steps: determining first floating point data to be inversely quantized in a model; regarding the first floating point data as first integer data with the same bit width as the first floating point data, and performing first type conversion processing of expanding the first bit width to a second bit width to generate intermediate floating point data; performing second type conversion processing for maintaining a second bit width on the intermediate floating point data to generate second integer data; performing format correction processing on the second integer data to generate inversely quantized second floating point data; according to the method, the inverse quantization process can be simplified, and the calculation efficiency can be improved, so that chips which are partially limited by instruction sets and lack special calculation instruction support for low-precision floating point data are adapted, and the overall performance of artificial intelligence model training is improved.