# US 2026/0065081 A1 · Neural Network Comprising Matrix Multiplication

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0065081 A1
- Document ID: US20260065081A1
- Status: Published application
- Kind: A1
- Application number: 19/381,373
- Filed: 2025-11-06
- Published: 2026-03-05
- Earliest claimed: 2021-01-04
- Assignees: Imagination Technologies Limited
- Applicants: Imagination Technologies Limited
- Inventors: Biswarup Choudhury; Aria Ahmadi; James Imber; Cagatay Dikici; Timothy Atherton
- Web page: https://patentgrep.com/patent/US20260065081A1

## CPC

- G06N 3/10: Interfaces, programming languages or software development kits, e.g. for simulating neural networks
- G06F 17/16: Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)}
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/063: using electronic means
- G06V 10/82: using neural networks
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

A method and data processing system using a processor implement a neural network containing at least one matrix multiplication operation. A set of operations to which the matrix multiplication operations are mapped is evaluated, the set of operations including at least one convolution operation, to thereby evaluate the matrix multiplication operation, whereby the processor is adapted to multiply the same set of weights simultaneously by multiple sets of input data elements in parallel at multiple processing elements.

## Claims

### Claim 1

A method of implementing, using a processor, a neural network comprising at least one layer, wherein the at least one layer comprises a matrix multiplication operation between a first tensor X and a second tensor Y, the method comprising:
evaluating a set of operations to which the matrix multiplication operations is mapped, the set of operations including at least one convolution operation, to thereby evaluate the matrix multiplication operation, whereby said processor is adapted to multiply the same set of weights simultaneously by multiple sets of input data elements in parallel at multiple processing elements.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the first tensor X or a tensor derived from it is treated as input data for the at least one convolution operation, and the second tensor Y or a tensor derived from it is treated as coefficient data for the at least one convolution operation.

### Claim 3 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured second tensor derived from the second tensor Y, wherein the reconfigured second tensor is treated as coefficient data for the at least one convolution operation, wherein the second tensor Y has dimensions [ . . . , Q, . . . , R, . . . ] and wherein the reconfigured second tensor has the dimension with size R of the second tensor Y arranged in the output channel dimension.

### Claim 4 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured first tensor derived from the first tensor X and obtaining a reconfigured second tensor derived from the second tensor Y, wherein the reconfigured first tensor is treated as input data for the at least one convolution operation, and the reconfigured second tensor is treated as coefficient data for the at least one convolution operation, wherein the first tensor X has dimensions [ . . . , P, . . . , Q, . . . ] and the second tensor Y has dimensions [ . . . , Q, . . . , R, . . . ], and wherein the reconfigured first tensor has the dimension with size Q of the first tensor X arranged in the input channel dimension, and the reconfigured second tensor has the dimension with size Q of the second tensor Y arranged in the input channel dimension.

### Claim 5 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured first tensor derived from the first tensor X, wherein the reconfigured first tensor is treated as input data for the at least one convolution operation, wherein the first tensor X has dimensions [ . . . , P, . . . , Q, . . . ], and wherein the reconfigured first tensor has the dimension with size P of the first tensor X arranged in a dimension that is traversed by the at least one convolution operation.

### Claim 6 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured first tensor derived from the first tensor X, wherein the processor is configured to evaluate the at least one convolution operation by processing in parallel several sets of one or more input data elements selected along a first dimension traversed by the convolution operation, and
wherein the reconfigured first tensor is treated as input data for the at least one convolution operation, wherein the first tensor X has dimensions [ . . . , P, . . . , Q, . . . ], and wherein the reconfigured first tensor has the dimension with size P of the first tensor X arranged in the first dimension.

### Claim 7 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured first tensor derived from the first tensor X and obtaining a reconfigured second tensor derived from the second tensor Y, wherein:
the first tensor X has dimensions [1, 1, P, Q] and the second tensor Y has dimensions [1, 1, Q, R];
the reconfigured first tensor and the reconfigured second tensor are input to the at least one convolution;
the reconfigured first tensor has dimensions [1, Q, 1, P]; and
the reconfigured second tensor has dimensions [R, Q, 1, 1].

### Claim 8 (depends on 1)

The method of claim 1, further comprising obtaining B reconfigured first tensors and obtaining B reconfigured second tensors, wherein:
the first tensor X has dimensions [M, N, P, Q] and the second tensor Y has dimensions [M′, N′, Q, R], where B=(max(M, M′) max(N,N′))>1;
the B reconfigured first tensors are derived from the first tensor X, each B reconfigured first tensor having dimensions [1, Q, 1, P];
the B reconfigured second tensors are derived from the second tensor Y, each B reconfigured second tensor having dimensions [R, Q, 1, 1]; and
the at least one convolution comprises B convolutions applied to respective pairs of the reconfigured first tensors and reconfigured second tensors.

### Claim 9 (depends on 1)

The method of claim 1, further comprising obtaining a reconfigured first tensor derived from the first tensor X and obtaining a reconfigured second tensor derived from the second tensor Y, wherein:
the first tensor X has dimensions [M, N, P, Q] and the second tensor Y has dimensions [M′, N′, Q, R];
the reconfigured first tensor has dimensions [1, BQ, 1, P];
the reconfigured second tensor has dimensions [BR, Q, 1, 1]; and
the at least one convolution comprises a grouped convolution, with B groups each with Q input channels and R output channels, applied to the reconfigured first tensor and reconfigured second tensor,
wherein B=(max(M, M′) max(N,N′)).

### Claim 10 (depends on 1)

The method of claim 1, wherein the first tensor X has dimensions [M, N, P, 1] and the second tensor Y has dimensions [M′, N′, 1, R].

### Claim 11 (depends on 1)

The method of claim 1, wherein the method comprises:
mapping the matrix multiplication operation to a graph of neural network operations including at least one transformation and the at least one convolution operation; and
evaluating the graph of neural network operations to thereby evaluate the matrix multiplication operation.

### Claim 12 (depends on 11)

The method of claim 11, further comprising, before mapping the matrix multiplication operation to the graph of neural network operations,
analysing the matrix multiplication operation, and
determining, based on a result of the analysing, how to implement the matrix multiplication operation, comprising determining that the matrix multiplication operation should be implemented using the at least one transformation and the at least one convolution operation, and rejecting at least one alternative method for implementing the matrix multiplication operation.

### Claim 13 (depends on 12)

The method of claim 12, wherein the determining how to implement the matrix multiplication operation is based on one or more of:
a size of the first tensor in one or more dimensions;
a size of the second tensor in one or more dimensions;
a memory-access bandwidth required to implement the matrix multiplication operation using the selected method;
a memory size required to implement the matrix multiplication operation using the selected method;
a number of hardware passes through the fixed-function hardware that will be required to implement the matrix multiplication operation using the selected method;
an execution time on the fixed function hardware that will be required to implement the matrix multiplication operation using the selected method;
a power consumption required to implement the matrix multiplication operation using the selected method; and
a capability of the fixed-function hardware.

### Claim 14

A data processing system for implementing a neural network comprising at least one layer, wherein the at least one layer comprises a matrix multiplication operation between a first tensor X and a second tensor Y, the data processing system comprising:
a processor, wherein the processor is configured to evaluate a set of operations to which the matrix multiplication operations is mapped, the set of operations including at least one convolution operation, to thereby evaluate the matrix multiplication operation, and whereby said processor is adapted to multiply the same set of weights simultaneously by multiple sets of input data elements in parallel at multiple processing elements.

### Claim 15 (depends on 14)

The data processing system of claim 14, wherein the processor comprises:
an input buffer, configured to temporarily store input data elements;
a coefficient buffer, configured to temporarily store weights; and
a plurality of processing elements, each of which is configured to multiply one or more input data elements by one or more respective weights,
wherein, in each of a plurality of hardware cycles:
the coefficient buffer is configured to supply one set of one or more weights concurrently to all of the processing elements, and
the input buffer is configured to supply each of the processing elements with respective different sets of one or more input data elements.

### Claim 16 (depends on 14)

The data processing system of claim 14, wherein the data processing system comprises a mapping unit, configured to map the matrix multiplication operation to a graph of neural network operations including at least one transformation and the at least one convolution operation; and wherein the processor is configured to evaluate the graph of neural network operations.

### Claim 17 (depends on 16)

The data processing system of claim 16, further comprising a memory manipulation module, for manipulating data stored in a memory, wherein the at least one transformation is performed using the memory manipulation module.

### Claim 18 (depends on 1)

The method of claim 1, wherein the layer comprising the matrix multiplication operation is a classification layer, for classifying an input to the neural network into one of a number of categories.

### Claim 19 (depends on 1)

The method of claim 1, wherein the neural network is configured for use in one of:
a natural language processing application; and
an image processing application,
and/or wherein the neural network comprises an attention-based neural network.

### Claim 20 (depends on 1)

A non-transitory computer readable storage medium having stored thereon computer readable code configured to cause the method as set forth in claim 1 to be performed when the code is run.
