# US 2023/0418606 A1 · Vector population count determination in memory

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

- Number: US 2023/0418606 A1
- Document ID: US20230418606A1
- Status: Published application
- Kind: A1
- Application number: 18/202,161
- Filed: 2023-05-25
- Published: 2023-12-28
- Earliest claimed: 2015-03-13
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Sanjay Tiwari
- Web page: https://patentgrep.com/patent/US20230418606A1

## CPC

- G06F 9/3004: {to perform operations on memory}
- G06F 7/607: {number-of-ones counters, i.e. devices for counting the number of input lines set to ONE among a plurality of input lines, also called bit counters or parallel counters (for applications thereof, see the relevant places, e.g. G06F7/49, G06F7/5013, G06F7/509, H03M1/00, H03M7/20)}
- G06F 9/30021: {Compare instructions, e.g. Greater-Than, Equal-To, MINMAX}
- G06F 9/30036: {Instructions to perform operations on packed data, e.g. vector, tile or matrix operations}
- G06F 9/30038: {using a mask}
- G06F 15/7821: {Tightly coupled to memory, e.g. computational memory, smart memory, processor in memory}
- G06F 15/7839: {with memory}
- G11C 7/1006: {Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor}
- G11C 7/1009: {Data masking during input/output}
- G11C 7/1012: {Data reordering during input/output, e.g. crossbars, layers of multiplexers, shifting or rotating}
- G11C 11/4096: Input/output [I/O] data management or control circuits, e.g. reading or writing circuits, I/O drivers or bit-line switches
- G11C 11/4091: Sense or sense/refresh amplifiers, or associated sense circuitry, e.g. for coupled bit-line precharging, equalising or isolating
- G11C 2207/002: Isolation gates, i.e. gates coupling bit lines to the sense amplifier
- G11C 2207/005: Transfer gates, i.e. gates coupling the sense amplifier output to data lines, I/O lines or global bit lines
- G11C 2207/104: Embedded memory devices, e.g. memories with a processing device on the same die or ASIC memory designs
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Examples of the present disclosure provide apparatuses and methods for determining a vector population count in a memory. An example method comprises determining, using sensing circuitry, a vector population count of a number of fixed length elements of a vector stored in a memory array.

## Claims

### Claim at position 1

-20. (canceled)

### Claim 21

A method, comprising:
determining a vector population count of a number of elements of a vector stored in a memory array, wherein the number of elements of the vector are stored in a portion of a row in the memory array by:
performing a number of comparison iterations in a compute component coupled to the memory array, wherein performing the number of comparison iterations comprises:
determining a reduction vector for each of the number of comparison iterations, wherein determining the reduction vector includes determining a reduction vector width for each of the number of comparison iterations and wherein each of the number of comparison iterations compares a number of bits that correspond to the reduction vector width; and
determining a pattern mask for each of the number of comparison iterations.

### Claim 22 (depends on 21)

The method of claim 21, comprising determining a quantity of comparison iterations to perform by calculating log2 of a number of bits in each of the number of elements.

### Claim 23 (depends on 21)

The method of claim 21, comprising determining an elemental mask for the vector, wherein the elemental mask represents a most significant bit of each of the number of elements.

### Claim 24 (depends on 21)

The method of claim 21, wherein performing the number of comparison iterations includes comparing 2n bits during each respective comparison iteration.

### Claim 25 (depends on 21)

The method of claim 21, wherein performing the number of comparison iterations includes performing a half add operation of a first portion and a second portion of the pattern mask for each of the number of comparison iterations

### Claim 26 (depends on 21)

The method of claim 21, wherein performing the number of comparison iterations includes performing a loop that includes shifting a carry of the half add operation to the left one place, and checking for carry values using a BlockOR operation, and performing another half add operation with the shift carry values and a sum of the half add operation.

### Claim 27

An apparatus comprising:
a group of memory cells coupled to a first access line of a memory array and configured to store a number of elements on a portion of the first access line; and
a compute component coupled to the memory array;
wherein the apparatus is configured to:
perform a number of comparison iterations, wherein each of the number of comparison iterations includes determining a reduction vector for each of the number of comparison iterations, wherein determining the reduction vector includes determining a reduction vector width for each of the number of comparison iterations and wherein each of the number of comparison iterations compares a number of bits that correspond to the reduction vector width; and
output a vector population count that indicates how many bits of each of the number of elements have a particular data value in response to performing the number of comparison iterations.

### Claim 28 (depends on 27)

The apparatus of claim 27, wherein the controller is configured to determine the number of comparison iterations to perform by calculating log2 of a number of bits in the number of elements.

### Claim 29 (depends on 27)

The apparatus of claim 27, wherein the controller is configured to calculate an output for each of the number of comparison iterations that is used by a subsequent comparison iteration to determine the vector population count.

### Claim 30 (depends on 27)

The apparatus of claim 27, wherein the controller is configured to perform at least one of an AND operation, an OR operation, and a SHIFT operation using sensing circuitry to determine the vector population count.

### Claim 31

An apparatus, comprising:
a group of memory cells coupled to a first access line of a memory array and configured to store a vector comprising a number of elements on a portion of the first access line; and
a compute component coupled to the memory array;
wherein the apparatus is configured to:
perform at least one of an AND operation, an OR operation, and a SHIFT operation using the compute component to determine a vector population count of the number of elements by:
determining a reduction vector for each of a number of comparison iterations, wherein determining the reduction vector includes determining a reduction vector width for each of the number of comparison iterations and wherein each of the number of comparison iterations compares a number of bits that correspond to the reduction vector width; and
determining a pattern mask for each of the number of comparison iterations, wherein each of the pattern masks include a first portion of the pattern mask and a second portion of the pattern mask.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein the apparatus is configured to perform a half add operation on the first portion of the pattern mask and the second portion of the pattern mask for each of the number of comparison iterations.

### Claim 33 (depends on 32)

The apparatus of claim 32, wherein the apparatus is configured to output a vector population count for each of the number of elements.

### Claim 34 (depends on 31)

The apparatus of claim 31, wherein the apparatus is configured to determine a most significant bit of each of the number of elements.

### Claim 35 (depends on 31)

The apparatus of claim 31, wherein the apparatus is configured to store elements representing a most significant bit of each of the number of elements as an elemental mask.

### Claim 36 (depends on 31)

The apparatus of claim 31, wherein the apparatus is configured to determine the number of comparison iterations to perform by calculating log2 of a number of bits in the number of elements.

### Claim 37 (depends on 31)

The apparatus of claim 31, wherein the vector includes 256 bits.

### Claim 38 (depends on 37)

The apparatus of claim 37, wherein the vector includes eight 32 bit elements.

### Claim 39 (depends on 37)

The apparatus of claim 37, wherein the vector includes one 256 bit element.

### Claim 40 (depends on 37)

The apparatus of claim 37, wherein the vector includes four 64 bit elements
