Haynes Beffel & Wolfeld LLP
Computationally efficient general matrix-matrix multiplication (GeMM)
A computation unit that comprises (i) a multiplicand vector decomposer that generates a decomposed multiplicand vector which uses a sequence of first and second concatenated multiplicand sub-elements (1st2ndCMCSE) in a lower-precision format (LPF) to represent corresponding ones of multiplicand elements in a multiplicand vector in a higher-precision format (HPF), (ii) a multiplier vector decomposer that generates a decomposed multiplier vector which uses a sequence of first and second concatenated multiplier sub-elements (1st2ndCMLSE) in the LPF to represent corresponding ones of multiplier elements in a multiplier vector in the HPF, (iii) a multiplicand tensor encoder that encodes double reads of the sequence of the 1st2ndCMCSE in a decomposed multiplicand tensor, and (iv) a product vector generator that generates a product vector containing a sequence of first and second concatenated product sub-elements by executing general matrix-matrix multiplication (GeMM) operations between the double reads of the 1st2ndCMCSE and corresponding ones of the 1st2ndCMLSE.
SambaNova Systems, Inc.
G G G G G G
G06N G06F G06F G06F G06F G06N
additional additional inventional inventional inventional additional
Xiaoyan Mingran Yongning
Li Wang Sheng