22 results about "Matrix manipulation" patented technology

The present invention relates to the technical field of data analysis, and in particular to a data monitoring-based intelligent supervision system and method for abnormal data. The system comprises a data transceiving module, a matrix processing module, a feature parsing module, an anomaly localization module and a part scaling module; the data transceiving module is configured to send and receive matrix data; the matrix processing module is configured to fit a composite matrix and output a processed matrix; the feature parsing module is configured to determine whether the final processed matrix has a data processing error or not; the anomaly localization module is configured to locate a node device in which an error step has occurred; and the part scaling module is configured to scale a processed matrix of an abnormal device. The present invention can find abnormal data, and locate an abnormal device, thereby reducing the effect of data anomalies on production processes and device performance, helping industrial control systems to discover and solve problems in time, and improving the production efficiency.

The invention discloses an employee ability assessment method and system based on a structure attribution neural network, and a medium, and belongs to the field of power systems, and the method comprises the steps: extracting the partial derivative information of an ability assessment model based on a gradient back propagation mechanism, determining the gradient sensitivity based on each partial derivative information, and determining a weight parameter; processing the real-time evaluation event according to the weight parameter to obtain a target evaluation event, and performing matrix processing and division according to the index service dimension to obtain a plurality of sub-matrixes, so that the capability evaluation model splices feature extraction results output after extraction of the plurality of structure sub-networks for each sub-matrix into an intermediate vector, the intermediate vector is predicted through the summary regression network, a target evaluation result is output, the structure dimension of each structure sub-network is in one-to-one correspondence with the service dimension, and the model adopts a loss function based on attribution guidance, so that objective and accurate evaluation of the ability of the to-be-evaluated employee can be realized through implementation of the method and the system.

This application provides a data processing method and a readable storage medium based on a matrix processor. The method includes: reading W first elements from a first matrix and sending the W first elements to a computing unit of the matrix processor for calculation; wherein W is greater than the width N of the first matrix and less than or equal to the number K of the computing units of the matrix processor; repeating the above steps until the number of remaining elements in the first matrix is ​​less than W; and in response to the number of remaining elements in the first matrix being non-zero, sending the remaining elements to the computing unit for calculation. This method can improve the utilization rate of the matrix processor's computing units, reduce the number of calculation cycles, shorten the calculation time, and fully utilize the computing units of the matrix processor.

A MIMO, equalizer circuit (300) comprises a controller (339); a calculation circuit (302) that generates and outputs an autocorrelation matrix W (308) in response to a received covariance matrix RI (123) and channel estimate matrix H (121). A matrix manipulation circuit (316) receives and combines a received inverted autocorrelation matrix (315) and channel estimate matrix H (121) and outputs an equalization gain, P, matrix (324); receives and combines the inverted autocorrelation matrix (315) and a received signal vector y (301) and the channel estimate matrix H (121) and outputs a 'f' vector (323). A successive interference cancellation, SIC, detection circuit (325) converts the received P matrix (324) into a first orthogonal unitary matrix Q (328) and a first upper triangular matrix R (327), and converts the matrix Q (328) and the matrix R (327) and f vector (323) into a SIC estimated, equalized symbol, Z2, vector (330) that is output.

The invention discloses a hardware accelerator supporting pulse Transform calculation and an acceleration method of the hardware accelerator. The accelerator comprises a control module, a PE calculation unit array, a matrix processing array, a full-connection core and a storage module. The PE calculation unit array is used for realizing tasks of pulse convolution calculation, pulse distribution and membrane potential maximum pooling calculation; the matrix processing array is used for realizing an operation task of a pulse matrix based on a bit AND and bit OR operation mode; and the full-connection core is used for realizing a pulse full-connection calculation task. According to the invention, acceleration support of a pulse self-attention mechanism and a Transform architecture is realized through the PE calculation unit array, the matrix processing array and the full-connection kernel, and meanwhile, the calculation energy consumption of the accelerator is reduced by adopting a bit AND and bit OR operation mode, so that the deployment universality of the accelerator is improved.

In one embodiment, a matrix processor comprises a memory to store a matrix operand and a strided read sequence, wherein: the matrix operand is stored out of order in the memory; and the strided read sequence comprises a sequence of read operations to read the matrix operand in a correct order from the memory. The matrix processor further comprises circuitry to: receive a first instruction to be executed by the matrix processor, wherein the first instruction is to instruct the matrix processor to perform a first operation on the matrix operand; read the matrix operand from the memory based on the strided read sequence; and execute the first instruction by performing the first operation on the matrix operand.

The invention discloses a weight matrix processing method and device, equipment, a storage medium and a product. The method comprises the steps that a target weight matrix is loaded; wherein the target weight matrix is a third-precision weight matrix which is arranged in a preset format and is formed by packaging a first-precision weight matrix; carrying out unpacking and inverse quantization processing on the target weight matrix to obtain a weight matrix with second precision; wherein the third precision is higher than the second precision, and the second precision is higher than the first precision; and storing the weight matrix with the second precision to an on-chip storage unit so as to be loaded to a tensor core to execute matrix multiplication operation. According to the embodiment of the invention, the weight matrix can be compatible with the operation logic of tcore, so that the matrix multiplication operation can be smoothly completed in the tcore.

For purposes of compression and decompression operations, a tensor is split into tiles having a tile size, and values at a given position in the respective tiles are processed as a stream. In some example implementations, for compression operations, a matrix processing tool can separately apply variable-rate compression to different streams of values of the tensor, with the different streams being associated with different positions of the tile size. For decompression operations, the matrix processing tool can quickly reconstruct different streams of values of the tensor. The decompression operations can be performed in parallel, with different decoders decompressing different streams of values of the tensor. In this way, soon after decompression starts, tensor blocks of values of the tensor can be loaded to local memory of tensor cores for matrix multiplication and accumulation operations, which can help reduce latency and fully utilize the tensor cores.

Disclosed are a method for generating matrix index information for a target matrix including a sparse matrix, and a method for processing a matrix by using matrix index information. The disclosed matrix index information generation method comprises the steps of: identifying the presence or absence of a non-zero element in each row or column of a target matrix, and generating a first bitstring including information on the presence or absence of the non-zero element in each row or column of the target matrix.

The application discloses a hardware architecture and a design space exploration method for accelerating multi-channel convolution, comprising an external storage module, a preprocessing module, a cache module, a matrix multiplication module and an output dimension rearrangement module, the external storage module is connected to the preprocessing module, the preprocessing module is connected to the cache module, the cache module is connected to the matrix multiplication module, the matrix processing module is connected to the output dimension rearrangement module; a task level pipeline is formed among the preprocessing module, the cache module and the matrix multiplication module, and parallel processing of three tasks of matrixing of a feature map and a convolution kernel, intermediate value caching and matrix multiplication operation is realized. The application converts multi-channel convolution into matrix multiplication and accelerates the same through design of a hardware structure, simultaneously proposes a design space exploration method based on performance and execution time, maximally improves resource utilization, and efficiently realizes real-time calculation of multi-channel convolution.

The application discloses a weight matrix processing method and device based on ReRAM, and the method comprises the following steps: acquiring the activated row number and the activated column number of a memistor ReRAM; performing non-structure pruning and compression on a weight matrix to obtain a compressed matrix block, wherein the row number of the compressed matrix block is less than or equal to the activated row number, the column number of the compressed matrix block is less than or equal to the activated column number, the row positions of each weight value in the same row in the compressed matrix block correspond to the same row position of the weight matrix, and the column positions of each weight value in the same column in the compressed matrix block correspond to the same column position of the weight matrix. By implementing the application, the matching application of the compressed matrix block and the ReRAM can be realized, the utilization efficiency of the ReRAM is improved, and the operation of the neural network is accelerated.

For purposes of compression and decompression operations, a tensor is split into tiles having a tile size, and values at a given position in the respective tiles are processed as a stream. In some example implementations, for compression operations, a matrix processing tool can separately apply variable-rate compression to different streams of values of the tensor, with the different streams being associated with different positions of the tile size. For decompression operations, the matrix processing tool can quickly reconstruct different streams of values of the tensor. The decompression operations can be performed in parallel, with different decoders decompressing different streams of values of the tensor. In this way, soon after decompression starts, tensor blocks of values of the tensor can be loaded to local memory of tensor cores for matrix multiplication and accumulation operations, which can help reduce latency and fully utilize the tensor cores.

The present disclosure provides a data format conversion method and device, and a matrix processing method and device, and relates to the technical field of computers, in particular to the technical field of artificial intelligence, deep learning, chips and the like. The specific implementation scheme of the data format conversion method is as follows: determining a maximum value of a target matrix according to each element in the target matrix; determining an offset according to a numerical value distribution interval of each element; determining a plurality of continuous numerical value intervals according to a numerical digit width of an index bit of a target data format, the offset and the maximum value of the target matrix; and converting an original data format of the target matrix into the target data format according to a corresponding relationship between each element and the plurality of numerical value intervals and a corresponding relationship between the plurality of numerical value intervals and the target data format. According to the scheme of the present disclosure, the operation amount of data format conversion can be reduced, and the quantization precision of each element in the target matrix can be improved while considering the numerical value range that can be represented by each element.

In one embodiment, a matrix processor comprises a memory to store a matrix operand and a strided read sequence, wherein: the matrix operand is stored out of order in the memory; and the strided read sequence comprises a sequence of read operations to read the matrix operand in a correct order from the memory. The matrix processor further comprises circuitry to: receive a first instruction to be executed by the matrix processor, wherein the first instruction is to instruct the matrix processor to perform a first operation on the matrix operand; read the matrix operand from the memory based on the strided read sequence; and execute the first instruction by performing the first operation on the matrix operand.

An example matrix processor includes processing elements arranged as a grid, with the matrix processor being configured to receive a first matrix and a second matrix, wherein the first matrix is to be multiplied by the second matrix; transpose the second matrix; organize the second matrix into a plurality of columns, wherein each column is a row of the second matrix; and over one or more cycles, sequentially provide the columns of the second matrix and the rows of the first matrix to the processing elements, wherein the processing elements are configured as multiply-accumulate units (MAC units), and wherein a processing result is stored in the processing elements.

and an operand storage circuit configured to store information for forming the first and second input operands for the matrix processing circuit, and a masking circuit configured to perform a masking operation to mask at least a portion of the matrix processing operation or information stored in the operand storage circuit based on masking state data indicating the locations of one or more masked rows or columns that are processed to represent masked values. This is useful for improving performance of 2D convolution operations because masking can be used to mask selected rows or columns when performing 2D convolution as a series of 1×1 convolution operations applied to different kernel positions.

The present disclosure provides systems and methods for detecting an in or out-of-hand state of a hand. A system for detecting an in or out-of-hand state of a hand comprises: a matrix processor for generating matrix factors; the pre-estimator is used for receiving the torsion bar lower angle of the vehicle steering wheel as input to obtain a torsion bar torque pre-estimated value of the vehicle steering wheel, and controlling the torsion bar torque pre-estimated value to follow the torsion bar torque reference value based on the matrix factor to obtain a driver hand torque pre-estimated value; the judging device is used for determining whether a vehicle steering wheel is in a hand-in state or a hand-out state based on the driver hand torque estimated value, and the estimating device is established based on the driver hand torque estimated value, the system inertia torque estimated value, the system damping torque estimated value and the torsion bar torque estimated value. Other embodiments are also described and claimed.

An N-channel alternating analog-to-digital converter (ADC) with variable delays added to the input sampling clock of each ADC. During calibration, these variable delays are programmed by a successive approximation register (SAR) to minimize time phase mismatch between channels. Within each channel, the ADC output is filtered, and a product derivative correlator generates a product derivative factor of the correlation between two adjacent ADC channels. A matrix processor arranges the product derivative factors from the product derivative correlator into a matrix and multiplies this matrix by a correlation matrix. The correlation matrix is ​​a constant generated by an N×N shift matrix. The matrix processor outputs a sign bit vector. Each bit in the sign bit vector determines when to set or clear a test SAR bit to adjust the variable delay of the channel. Sampling clock and time phase mismatch can be reduced to one LSB across all N channels.

This disclosure provides methods and apparatus for data format conversion and matrix processing, relating to the field of computer technology, particularly artificial intelligence, deep learning, and chip technology. The specific implementation of the data format conversion method is as follows: Based on each element in the target matrix, determine the maximum value of the target matrix; based on the digit width of the exponent of the target data format and the maximum value of the target matrix, determine multiple consecutive numerical intervals; based on the correspondence between each element and the multiple numerical intervals, and the correspondence between the multiple numerical intervals and the target data format, convert the original data format of the target matrix into the target data format. According to the scheme of this disclosure, the computational load of data format conversion can be reduced, and the quantization accuracy of each element in the target matrix can be improved while maintaining the representable numerical range of each element.

The application discloses a matrix compression method, a matrix processing method and related devices, and belongs to the field of data processing. The method comprises the following steps: dividing a first matrix stored in a memory to obtain a plurality of first sub-matrices; compressing non-zero element groups in each first sub-matrix in the plurality of first sub-matrices according to a first direction to obtain a plurality of second sub-matrices corresponding to the first matrix; dividing each second sub-matrix in the plurality of second sub-matrices to obtain a plurality of third sub-matrices; and generating a compression result of the first matrix based on the plurality of third sub-matrices. According to the application, only non-zero element groups exist in the first sub-matrices, so that a part of elements with a value of zero in the first matrix is removed, and therefore, the compression result of the first matrix can effectively reduce the number of zero elements that need to be stored, thereby saving data storage space.

The invention provides a matrix processing circuit, method, device and system, and relates to the field of matrix processing, and the circuit comprises a control module which is connected with a register block module and a data selector, and the register block module is connected with a transposition module. The transpose module can convert the received matrix data into transpose matrix data and send the transpose matrix data to the register block module, so that the matrix processing circuit can complete storage of the matrix data and can also complete storage of the transpose matrix data. The control module can determine to write the matrix data or the transposed matrix data into the target register block according to the input data enable signal and can also output a selection signal to the data selector, and the selection signal can enable the data selector to determine to read the matrix data or the transposed matrix data in the target register block. Therefore, the matrix processing circuit provided by the invention can achieve the effect of supporting efficient carrying of a common matrix and a transposed matrix.

The present invention discloses an accelerator and a computing system for a video generation model, the accelerator comprising: a sparsification unit, the input activation of which comprises a plurality of consecutive frames, each frame being segmented into a plurality of marks; the rarefaction unit is used for performing inter-frame rarefaction and intra-frame rarefaction on input activation containing a plurality of frames so as to screen and record similar marks; the matrix processing engine is used for calculating the marks to obtain output marks; wherein if the two marks are recorded to be similar, an output mark of one mark is calculated, and the output mark serves as the output mark of the two marks; and a recovery unit which generates an output activation according to the calculation result of the matrix processing engine and the record of the similar marks. According to the accelerator, the problem of redundant calculation overhead in an existing video generation model is solved by utilizing the similarity of video frames in time and space dimensions and designing a customized sparse and recovery unit, hardware resources can be fully utilized, and the accelerator has excellent performance and energy efficiency ratio.