US 2022/0035890 A1 · Time Domain Unrolling Sparse Matrix Multiplication System and Method

Abstract

A system and method for multiplying matrices are provided. The system includes a processor coupled to a memory and a matrix multiply accelerator (MMA) coupled to the processor. The MMA is configured to multiply, based on a bitmap, a compressed first matrix and a second matrix to generate an output matrix including, for each element i,j of the output matrix, calculate a dot product of an ith row of the compressed first matrix and a jth column of the second matrix based on the bitmap. Or, the MMA is configured to multiply, based on the bitmap, the second matrix and the compressed first matrix and to generate the output matrix including, for each element i,j of the output matrix, calculate a dot product of an ith row of the second matrix and a jth column of the compressed first matrix based on the bitmap.

Claims20

Dependent claims

A system, comprising:

a processor coupled to a memory;
and
a matrix multiply accelerator (MMA), coupled to the processor, configured to:
multiply, based on a bitmap, a compressed first matrix and a second matrix to generate an output matrix, the bitmap including a plurality of bit positions, each bit position corresponding to a different element of the first matrix, said multiply including:
for each element i,j of the output matrix, calculate a dot product of an ith row of the compressed first matrix and a jth column of the second matrix based on the bitmap;
or multiply, based on the bitmap, the second matrix and the compressed first matrix and to generate the output matrix, including:
for each element i,j of the output matrix, calculate a dot product of an ith row of the second matrix and a jth column of the compressed first matrix based on the bitmap.

4 more elements

A computer-based method for multiplying matrices, comprising:

multiplying, based on a bitmap, a compressed first matrix and a second matrix to generate an output matrix, the bitmap including a plurality of bit positions, each bit position corresponding to a different element of the first matrix, said multiplying including:
for each element i,j of the output matrix, calculating a dot product of an ith row of the compressed first matrix and a jth column of the second matrix based on the bitmap;
or
multiplying, based on the bitmap, the second matrix and the compressed first matrix to generate the output matrix, including:
for each element i,j of the output matrix, calculating a dot product of an ith row of the second matrix and a jth column of the compressed first matrix based on the bitmap.

2 more elements

Dependencies are inferred from the claim text.

Time Domain Unrolling Sparse Matrix Multiplication System and Method

Life of this patent

Time Domain Unrolling Sparse Matrix Multiplication System and Method

Life of this patent

Abstract

Claims20