# US 2019/0377690 A1 · Method and Apparatus for Vector Permutation

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

- Number: US 2019/0377690 A1
- Document ID: US20190377690A1
- Status: Published application
- Kind: A1
- Application number: 16/551,587
- Filed: 2019-08-26
- Published: 2019-12-12
- Earliest claimed: 2013-07-15
- Assignees: Texas Instruments Incorporated
- Applicants: Texas Instruments Incorporated
- Inventors: Timothy David Anderson; Mujibur Rahman; Dheera Balasubramanian Samudrala; Peter Richard Dent; Duc Quang Bui
- Web page: https://patentgrep.com/patent/US20190377690A1

## CPC

- G06F 12/1045: associated with a data cache
- G06F 7/24: Sorting, i.e. extracting data from one or more carriers, rearranging the data in numerical or other ordered sequence, and rerecording the sorted data on the original carrier or on a different carrier or set of carriers {sorting methods in general}(G06F7/36 takes precedence)
- G06F 7/483: Computations with numbers represented by a non-linear combination of denominational numbers, e.g. rational numbers, logarithmic number system or floating-point numbers {(G06F7/4806, G06F7/4824, G06F7/49, G06F7/491, G06F7/544 take precedence)}
- G06F 7/487: Multiplying; Dividing {(G06F7/4833, G06F7/4836 take precedence)}
- G06F 7/4876: {Multiplying}
- G06F 7/49915: {Mantissa overflow or underflow in handling floating-point numbers}
- G06F 7/53: in parallel-parallel fashion, i.e. both operands being entered in parallel (G06F7/533 takes precedence)
- G06F 7/57: Arithmetic logic units [ALU], i.e. arrangements or devices for performing two or more of the operations covered by groups G06F7/483 – G06F7/556 or for performing logical operations {(G06F7/49, G06F7/491 take precedence)}
- G06F 9/3001: {Arithmetic instructions}
- G06F 9/30014: {with variable precision}
- G06F 9/30018: {Bit or string instructions}
- G06F 9/30021: {Compare instructions, e.g. Greater-Than, Equal-To, MINMAX}
- G06F 9/30032: {Movement instructions, e.g. MOVE, SHIFT, ROTATE, SHUFFLE}
- G06F 9/30036: {Instructions to perform operations on packed data, e.g. vector, tile or matrix operations}
- G06F 9/3004: {to perform operations on memory}
- G06F 9/30065: {Loop control instructions; iterative instructions, e.g. LOOP, REPEAT}
- G06F 9/30072: {to perform conditional operations, e.g. using predicates or guards}
- G06F 9/3009: {Thread control instructions}
- G06F 9/30098: {Register arrangements}
- G06F 9/30112: {comprising data of variable length}
- G06F 9/30145: {Instruction analysis, e.g. decoding, instruction word fields}
- G06F 9/30149: {of variable length instructions}
- G06F 9/3016: {Decoding the operand specifier, e.g. specifier format}
- G06F 9/32: Address formation of the next instruction, e.g. by incrementing the instruction counter (G06F9/38 takes precedence)
- G06F 9/345: of multiple operands or results {(addressing multiple banks G06F12/06)}
- G06F 9/3802: {Instruction prefetching}
- G06F 9/3818: {Decoding for concurrent execution}
- G06F 9/383: {Operand prefetching (cache prefetching G06F12/0862)}
- G06F 9/3836: {Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution}
- G06F 9/3851: {from multiple instruction streams, e.g. multistreaming}
- G06F 9/3856: {Reordering of instructions, e.g. using queues or age tags}
- G06F 9/3867: {using instruction pipelines}
- G06F 9/3887: {controlled by a single instruction for multiple data lanes [SIMD]}
- G06F 9/48: Program initiating; Program switching, e.g. by interrupt
- G06F 11/00: Error detection; Error correction; Monitoring (error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00)
- G06F 11/1048: {using arrangements adapted for a specific error detection or correction feature}
- G06F 12/0862: with prefetch
- G06F 12/0875: with dedicated cache, e.g. instruction or stack
- G06F 12/0897: with two or more cache hierarchy levels (with multilevel cache hierarchies G06F12/0811)
- G06F 12/1009: using page tables, e.g. page table structures
- G06F 17/16: Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)}
- H03H 17/06: Non-recursive filters
- H03H 17/0664: {where the output-delivery frequency is lower than the input sampling frequency, i.e. decimation}
- G06F 9/325: {for loops, e.g. loop detection or loop counter}
- G06F 9/381: {Loop buffering}
- G06F 9/3822: {Parallel decoding, e.g. parallel decode units}
- G06F 11/10: Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F 15/7807: {System on chip, i.e. computer system on a single chip; System in package, i.e. computer system on one or more chips in a single package}
- G06F 15/781: {On-chip cache; Off-chip memory}
- G06F 2212/452: Instruction code
- G06F 2212/60: Details of cache memory
- G06F 2212/602: Details relating to cache prefetching
- G06F 2212/68: Details of translation look-aside buffer [TLB]
- H03H 2017/0298: {DSP implementation}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03H: IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS (waveguides, resonators, lines or other devices of the waveguide type H01P)

## Abstract

A method is provided that includes performing, by a processor in response to a vector permutation instruction, permutation of values stored in lanes of a vector to generate a permuted vector, wherein the permutation is responsive to a control storage location storing permute control input for each lane of the permuted vector, wherein the permute control input corresponding to each lane of the permuted vector indicates a value to be stored in the lane of the permuted vector, wherein the permute control input for at least one lane of the permuted vector indicates a value of a selected lane of the vector is to be stored in the at least one lane, and storing the permuted vector in a storage location indicated by an operand of the vector permutation instruction.

## Claims

### Claim 1

A method comprising:
performing, by a processor in response to a vector permutation instruction, permutation of values stored in lanes of a vector to generate a permuted vector, wherein the permutation is responsive to a control storage location storing permute control input for each lane of the permuted vector, wherein the permute control input corresponding to each lane of the permuted vector indicates a value to be stored in the lane of the permuted vector, wherein the permute control input for at least one lane of the permuted vector indicates a value of a selected lane of the vector is to be stored in the at least one lane; and
storing the permuted vector in a storage location indicated by an operand of the vector permutation instruction.

### Claim 2 (depends on 1)

The method of claim 1, wherein the permute control input for a first lane of the permuted vector indicates one of all zeros are to be stored in the first lane, all ones are to be stored in the first lane, and the first lane is to be filled with a sign bit of a value of a selected lane of the vector.

### Claim 3 (depends on 1)

The method of claim 1, wherein a lane size of the permuted vector and the vector is eight bits.

### Claim 4 (depends on 1)

The method of claim 1, wherein the vector is an operand of the vector permutation instruction.

### Claim 5 (depends on 1)

The method of claim 1, wherein the vector is an intermediate vector generated responsive to the vector permutation instruction, wherein one half of the intermediate vector consists of values of selected lanes of a first vector and another half of the intermediate vector consists of values of selected lanes in a second vector.

### Claim 6 (depends on 5)

The method of claim 5, wherein a number of bits in lanes of the first vector and lanes of the second vector is one selected from 8, 16, 32, 64, 128, and 256.

### Claim 7 (depends on 5)

The method of claim 5, wherein the selected lanes of the first vector comprise one of even numbered lanes of the first vector and odd numbered lanes of the first vector and the selected lanes in the second vector comprise one of even numbered lanes of the second vector and odd numbered lanes of the second vector.

### Claim 8 (depends on 5)

The method of claim 5, wherein the selected lanes of the first vector are one selected from all lanes of a high half of the first vector and all lanes of a low half of the first vector and the selected lanes of the second vector are one selected from all lanes of a high half of the second vector and all lanes of a low half of the second vector.

### Claim 9

A processor comprising:
a control storage location configured to store a permute control input for each lane of an output vector; and
a permutation component coupled to the control storage location, wherein the permutation component is configured to store a value of any lane of an input vector in any lane of the output vector based on the permute control input for each lane of the output vector, the storing of values performed responsive to a vector permutation instruction.

### Claim 10 (depends on 9)

The processor of claim 9, wherein the permutation component is further configured to store a value of a lane in the input vector in a lane in the output vector when the permute control input for the lane in the output vector indicates the lane in the input vector.

### Claim 11 (depends on 9)

The processor of claim 9, wherein the permutation component is further configured to store one of all zeros and all ones in a first lane of the output vector based on the permute control input for the first lane.

### Claim 12 (depends on 9)

The processor of claim 9, wherein the permutation component is further configured to fill a first lane of the output vector with a sign bit of a value of a lane of the input vector indicated in the permute control input for the first lane.

### Claim 13 (depends on 9)

The processor of claim 9, wherein a lane size of the output vector and the input vector is eight bits.

### Claim 14 (depends on 9)

The processor of claim 9, wherein the input vector is an operand of the vector permutation instruction.

### Claim 15 (depends on 9)

The processor of claim 9, wherein the input vector is an intermediate vector generated by the vector permutation component responsive to the vector permutation instruction, wherein one half of the intermediate vector consists of values of selected lanes of a first vector and another half of the intermediate vector consists of values of selected lanes of a second vector.

### Claim 16 (depends on 15)

The processor of claim 15, wherein a number of bits in lanes of the first vector and lanes of the second vector is one selected from 8, 16, 32, 64, 128, and 256.

### Claim 17 (depends on 16)

The processor of claim 16, wherein the selected lanes of the first vector comprise one of even numbered lanes of the first vector and odd numbered lanes of the first vector and the selected lanes in the second vector comprise one of even numbered lanes of the second vector and odd numbered lanes of the second vector.

### Claim 18 (depends on 15)

The processor of claim 15, wherein the selected lanes of the first vector are one selected from all lanes of a high half of the first vector and all lanes of a low half of the first vector and the selected lanes of the second vector are one selected from all lanes of a high half of the second vector and all lanes of a low half of the second vector.

### Claim 19

A method comprising:
generating, by a processor in response to a vector permutation instruction, an intermediate vector, wherein one half of the intermediate vector consists of values of selected lanes of a first vector and another half of the intermediate vector consists of values from selected lanes of a second vector;
permuting the intermediate vector by the processor to generate a permuted vector, the permuting performed based on a control storage location storing permute control input for each lane of the permuted vector, wherein the permute control input corresponding to each lane indicates a value to be store in the lane; and
storing the permuted vector in a storage location indicated by an operand of the vector permutation instruction.

### Claim 20 (depends on 19)

The method of claim 19, wherein the permute control input for at least one lane of the permuted vector indicates a value of a selected lane of the intermediate vector is to be stored in the at least one lane.

### Claim 21 (depends on 19)

The method of claim 19, wherein the permute control input for a first lane of the permuted vector indicates that all zeros are to be stored in the first lane.

### Claim 22 (depends on 19)

The method of claim 19, wherein the permute control input for a first lane of the permuted vector indicates that all ones are to be stored in the first lane.

### Claim 23 (depends on 19)

The method of claim 19, wherein the permute control input for a first lane of the permuted vector indicates that the first lane is to be filled with a sign bit of a value of a selected lane of the intermediate vector.

### Claim 24 (depends on 19)

The method of claim 19, wherein a number of bits in lanes of the first vector and lanes of the second vector is one selected from 8, 16, 32, 64, 128, and 256.

### Claim 25 (depends on 19)

The method of claim 19, wherein the values of selected lanes of the first vector comprise one of values of even numbered lanes of the first vector and values of odd numbered lanes and the values of selected lanes in the second vector comprise one of values of even numbered lanes of the second vector and odd numbered lanes of the second vector.

### Claim 26 (depends on 19)

The method of claim 19, wherein the selected lanes of the first vector are one selected from all lanes of a high half of the first vector and all lanes of a low half of the first vector and the selected lanes of the second vector are one selected from all lanes of a high half of the second vector and all lanes of a low half of the second vector.
