# US 2020/0348911 A1 · Tiled Switch Matrix Data Permutation Circuit

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

- Number: US 2020/0348911 A1
- Document ID: US20200348911A1
- Status: Published application
- Kind: A1
- Application number: 16/928,958
- Filed: 2020-07-14
- Published: 2020-11-05
- Earliest claimed: 2018-08-30
- Assignees: Groq, Inc.
- Applicants: Groq, Inc.
- Inventors: Gregory Michael Thorson
- Web page: https://patentgrep.com/patent/US20200348911A1

## CPC

- G06F 7/768: {Data position reversal, e.g. bit reversal, byte swapping}
- H03M 13/2778: {Interleaver using block-wise interleaving, e.g. the interleaving matrix is sub-divided into sub-matrices and the permutation is performed in blocks of sub-matrices}
- G06F 7/762: {having at least two separately controlled rearrangement levels, e.g. multistage interconnection networks (G06F7/764 - G06F7/768 take precedence)}
- G06F 7/78: for changing the order of data flow, e.g. matrix transposition or LIFO buffers; Overflow or underflow handling therefor
- H03M 13/2764: {Circuits therefore}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Embodiments of the present disclosure pertain to switch matrix circuit including a data permutation circuit. In one embodiment, the switch matrix comprises a plurality of adjacent switching blocks configured along a first axis, wherein the plurality of adjacent switching blocks each receive data and switch control settings along a second axis. The switch matrix includes a permutation circuit comprising, in each switching block, a plurality of switching stages spanning a plurality of adjacent switching blocks and at least one switching stage that does not span to adjacent switching blocks. The permutation circuit receives data in a first pattern and outputs the data in a second pattern. The data permutation performed by the switching stages is based on the particular switch control settings received in the adjacent switching blocks along the second axis.

## Claims

### Claim 1

A permutation circuit comprising:
a first subset of a plurality of switching stages receiving input data and switch control settings, one or more switching stages in the first subset having a successively increasing size relative to a corresponding switching stage in the first subset;
a second subset of the plurality of switching stages generating an output data with an output pattern different from an input pattern of the input data based on the switch control settings, one or more switching stages in the second subset having a successively decreasing size relative to a corresponding switching stage in the second subset; and
at least one intermediate switching stage of the plurality of switching states connecting at least one switching stage of the first subset with at least one switching stage of the second subset.

### Claim 2 (depends on 1)

The permutation circuit of claim 1, wherein one or more of the plurality of switching stages is one of: a 16 by 16 switch, a 32 by 32 switch, and a 64 by 64 switch.

### Claim 3 (depends on 1)

The permutation circuit of claim 1, wherein one or more of the plurality of switching stages is one of: a N by N switch, a 2N by 2N switch, and a 4N by 4N switch, N being an integer.

### Claim 4 (depends on 1)

The permutation circuit of claim 1, wherein a first plurality of the switch control settings configure the permutation circuit to perform first data permutations on the input data, and a second plurality of the switch control settings configure the permutation circuit to perform second data permutations on the input data different from the first data permutations.

### Claim 5 (depends on 1)

The permutation circuit of claim 1, wherein the first and second data permutations are mapped to the switch control settings and stored in a memory coupled to the permutation circuit.

### Claim 6 (depends on 1)

The permutation circuit of claim 1, wherein a first switching stage of the first subset directly receives the input data having the input pattern, and a second switching stage of the second subset directly produces the output data having the output pattern.

### Claim 7 (depends on 6)

The permutation circuit of claim 6, wherein outputs of the first switching stage are shuffled between the first switching stage and a second switching stage of the first subset.

### Claim 8 (depends on 6)

The permutation circuit of claim 6, wherein outputs of a switching stage of the second subset are unshuffled between a first switching stage of the second subset and the second switching stage.

### Claim 9 (depends on 1)

The permutation circuit of claim 1, wherein the at least one intermediate switching stage has inputs coupled to outputs of a last switching stage of the first subset and has outputs coupled to inputs of a first switching stage of the second subset.

### Claim 10 (depends on 1)

The permutation circuit of claim 1, wherein the permutation circuit is distributed across a plurality of switching blocks.

### Claim 11 (depends on 10)

The permutation circuit of claim 10, wherein two or more of the plurality of switching stages span a plurality of adjacent switching blocks of the plurality of switching blocks and at least one of the plurality of switching stages does not span the adjacent switching blocks.

### Claim 12 (depends on 10)

The permutation circuit of claim 10, wherein multiple switching stages of the first subset span successively more adjacent switching blocks of the plurality of switching blocks.

### Claim 13 (depends on 10)

The permutation circuit of claim 10, wherein multiple switching stages of the second subset span successively fewer adjacent switching blocks of the plurality of switching blocks.

### Claim 14 (depends on 1)

The permutation circuit of claim 1, wherein different data permutations are mapped to different versions of the switch control settings and are specified for different sets of the input data.

### Claim 15 (depends on 1)

The permutation circuit of claim 1, wherein the permutation circuit is part of an artificial intelligence processor.

### Claim 16

A method comprising:
receiving, by a first subset of a plurality of switching stages, input data and switch control settings, one or more switching stages in the first subset having a successively increasing size relative to a corresponding switching stage in the first subset;
connecting, via at least one intermediate switching stage of the plurality of switching states, at least one switching stage of the first subset with at least one switching stage of a second subset of the plurality of switching stages, one or more switching stages in the second subset having a successively decreasing size relative to a corresponding switching stage in the second subset; and
generating, by the second subset of the plurality of switching stages, an output data with an output pattern different from an input pattern of the input data based on the switch control settings.

### Claim 17 (depends on 16)

The method of claim 16, further comprising:
coupling inputs of the at least one intermediate switching stage to outputs of a last switching stage of the first subset; and
coupling outputs of the at least one intermediate switching stage to inputs of a first switching stage of the second subset.

### Claim 18 (depends on 16)

The method of claim 16, further comprising:
shuffling the input data of a first pattern between a pair of switching stages of the first subset; and
unshuffling the input data of a second pattern between a pair of switching stages of the second subset.

### Claim 19 (depends on 16)

The method of claim 16, further comprising distributing the plurality of switching stages across a plurality of switching blocks, two or more of the plurality of switching stages span a plurality of adjacent switching blocks of the plurality of switching blocks and at least one of the plurality of switching stages does not span the adjacent switching blocks.

### Claim 20 (depends on 16)

The method of claim 16, wherein one or more of the plurality of switching stages is one of: a N by N switch, a 2N by 2N switch, and a 4N by 4N switch, N being an integer.
