# US 2026/0073208 A1 · Programmable in-memory computing accelerator for low-precision deep neural network inference

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

- Number: US 2026/0073208 A1
- Document ID: US20260073208A1
- Status: Published application
- Kind: A1
- Application number: 19/390,476
- Filed: 2025-11-14
- Published: 2026-03-12
- Earliest claimed: 2021-04-02
- Assignees: Arizona Board of Regents on behalf of Arizona State University; The Trustees of Columbia University in the City of New York
- Applicants: Arizona Board of Regents on behalf of Arizona State University; The Trustees of Columbia University in the City of New York
- Inventors: Jae-sun SEO; Bo ZHANG; Mingoo SEOK; Shihui YIN
- Web page: https://patentgrep.com/patent/US20260073208A1

## CPC

- G06N 3/063: using electronic means
- G06F 7/544: for evaluating functions by calculation {(G06F7/4824 takes precedence)}
- G06F 9/3004: {to perform operations on memory}
- G06F 9/3877: {using a secondary processor, e.g. coprocessor (peripheral processor G06F13/12)}
- G06F 9/3885: {using a plurality of independent parallel functional units}
- G06F 9/3887: {controlled by a single instruction for multiple data lanes [SIMD]}
- G06F 15/7821: {Tightly coupled to memory, e.g. computational memory, smart memory, processor in memory}
- G06F 15/7867: {with reconfigurable architecture}
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/0495: Quantised networks; Sparse networks; Compressed networks
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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

A programmable in-memory computing (IMC) accelerator for low-precision deep neural network inference, also referred to as PIMCA, is provided. Embodiments of the PIMCA integrate a large number of capacitive-coupling-based IMC static random-access memory (SRAM) macros and demonstrate large-scale integration of IMC SRAM macros. For example, a 28 nm prototype integrates 108 capacitive-coupling-based IMC SRAM macros of a total size of 3.4 megabytes (Mb), demonstrating one of the largest IMC hardware to date. In addition, a custom instruction set architecture (ISA) is developed featuring IMC and single-instruction-multiple-data (SIMD) functional units with hardware loop to support a range of deep neural network (DNN) layer types. The 28 nm prototype chip achieves a peak throughput of 4.9 tera operations per second (TOPS) and system-level peak energy-efficiency of 437 TOPS per watt (TOPS/W) at 40 megahertz (MHz) with a 1 volt (V) supply.

## Claims

### Claim 1

A method for distributing computations of deep neural networks (DNNs) in an accelerator, the method comprising:
mapping multiply-and-accumulate (MAC) operations to one or more of a plurality of in-memory computing (IMC) processing elements (PEs); and
mapping non-MAC operations to a single-instruction-multiple-data (SIMD) processor.

### Claim 2 (depends on 1)

The method of claim 1, wherein the SIMD processor is a multi-way SIMD processor.

### Claim 3 (depends on 2)

The method of claim 2, wherein the SIMD processor supports an ADD2 operation which multiplies a first half of its ways then adds a second half of its ways.

### Claim 4 (depends on 1)

The method of claim 1, wherein the SIMD processor supports each of the following types of operations: a LOAD operation which transfers data, an ADD operation which performs partial sum addition, an ADD2 operation which performs shift-and-add, a CMP operation which performs a comparison for computing 1-bit activation results, a CMP2 operation which performs a comparison for computing 2-bit activation results, a MAX operation which selects a maximum value during max-pooling, an LSHIFT operation which shifts data left, and an RSHIFT operation which shifts data right.

### Claim 5 (depends on 1)

The method of claim 1, wherein mapping the MAC operations and mapping the non-MAC operations is performed in response to receiving an instruction according to an in-memory computing (IMC) instruction set architecture (ISA).

### Claim 6 (depends on 5)

The method of claim 5, wherein the instruction comprises a regular instruction according to the IMC ISA, the regular instruction comprising:
read and write (R/W) addresses;
IMC PE and IMC macro selection and accumulation mode control; and
SIMD operands and SIMD operation code.

### Claim 7 (depends on 6)

The method of claim 6, wherein the regular instruction further comprises a field that defines repetitions for loop support.

### Claim 8 (depends on 6)

The method of claim 6, further comprising:
receiving the regular instruction to perform a first MAC operation or a first non-MAC operation;
receiving a loop instruction; and
performing the first MAC operation or the first non-MAC operation in accordance with the loop instruction using at least one of the plurality of IMC PEs and the SIMD processor.

### Claim 9 (depends on 8)

The method of claim 8, wherein the loop instruction comprises at least one of a loop-setup (SOL) and loop-end-check (EOL) instruction to define levels of nested for-loops.

### Claim 10 (depends on 9)

The method of claim 9, further comprising setting loop registers and counters based on the SOL instruction and the EOL instruction.
