IP Library › Granted Patent US 11,275,713
Granted Patent B2
US 11,275,713 · App. 16/004,358 · Granted Mar 15, 2022

Bit-serial linear algebra processor

Inventors: Heiner Giefers (Langnau am Albis, CH); Raphael Polig (Langnau am Albis, CH); Jan Van Lunteren (Rüschlikon, CH)
Assignee: International Business Machines Corporation
G06F15/8046G06F7/504G06F7/527G06F7/5443G06F17/16
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,275,713
App. No.
16/004,358
Filed
Jun 9, 2018
Granted
Mar 15, 2022
Kind
B2
Art Unit
2182
USPC
708/524
Abstract

The invention is notably directed to a computing system configured to perform linear algebraic operations. The computing system comprises a co-processing module comprising a co-processing unit. The co-processing unit comprises a parallel array of bit-serial processing units. The bit-serial processing units are adapted to perform the linear algebraic operations with variable precision. The invention further concerns a related computer implemented method and a related computer program product.

Claims (24)

1. A computing system configured to perform linear algebraic operations, the computing system comprising:

a co-processing module comprising a co-processing unit, the co-processing unit comprising a parallel array of bit-serial processing units, the bit-serial processing units being adapted to perform the linear algebraic operations with variable precision, wherein the co-processing module comprises a local memory, the local memory comprising a bit-level memory layout; and

a host unit comprising

a main memory;

a central processing unit; and

an offload engine adapted to configure the co-processing module for a subsequent data transfer between the main memory and the local memory;

wherein:

each of the bit-serial processing units comprises:

a bit-serial multiplier; and

a bit-serial adder; and

each of the bit-serial multipliers comprises:

first and second input lines, a control line, and a carry over line;

a plurality of stages, each of said stages in turn comprising:

an AND gate having first and second inputs coupled to the first and second input lines and an output;

a full adder including a first input coupled to said output of said AND gate, a second input, and an output; and

a flip-flop having an input coupled to said output of said full adder and having a stage output port;

wherein, for a first one of said plurality of stages, said second input of said full adder is coupled to said carry over line and for each of said plurality of stages other than said first one of said plurality of stages, said second input is coupled to said stage output port for a previous one of said stages; and

a bypass logic configured to support input data of variable precision, said bypass logic comprising:

a first multiplexer configured to read out multiplication results of one-bit precision from said stage output port of said first one of said plurality of stages, results of maximum precision from said stage output port of a last one of said plurality of stages, and results of corresponding intermediate precision from one or more of said stage output ports of one or more intermediate ones of said plurality of stages; and

a second multiplexer configured to read out intermediate results of a control bit from said control line.

2. The computing system according to claim 1 , wherein the bit-serial multipliers are configurable by software to perform the linear algebraic operations in variable precisions from 1-bit to k-bit, wherein k is the maximum precision of the bit-serial multiplier, the software comprising an application program carrying out linear algebraic computations.

3. The computing system according to claim 1 , wherein the bypass logic is configured to use power gating or clock gating to deactivate unused stages of the bit-serial multiplier.

4. The computing system according to claim 1 , wherein the parallel array of bit-serial processing units is a 2-dimensional systolic array having a plurality of rows and columns and configured to receive staggered bits of rows of a first matrix and staggered bits of columns of a second matrix.

5. The computing system according to claim 1 , wherein the linear algebraic operations are those of a deep neural network application.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 9, 2018
From: GIEFERS, HEINER; POLIG, RAPHAEL; VAN LUNTEREN, JAN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 046036/0731 →
Continuity (1)
Related Publication 20190377707A1 · Dec 12, 2019
Cited By (1)
US 12,717,629