IP Library Granted Patent US 8,832,614
Granted Patent B2
US 8,832,614 · App. 13/903,424 · Granted Sep 9, 2014

Technology mapping for threshold and logic gate hybrid circuits

Inventors: Sarma Vrudhula (Chandler, AZ); Niranjan Kulkarni (Phoenix, AZ)
Assignee: Arizona Board of Regents, a body corporate of the State of Arizona, acting for and on behalf of Arizona State University
G06F17/505G06F17/5022G06F17/5068G06F17/10
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 8,832,614
App. No.
13/903,424
Granted
Sep 9, 2014
Kind
B2
Abstract

A method of mapping threshold gate cells into a Boolean network is disclosed. In one embodiment, cuts are enumerated within the Boolean network. Next, a subset of the cuts within the Boolean network that are threshold is identified. To minimize power, cuts in the subset of the cuts are selected.

Claims (11)

1. A method of mapping threshold gate cells into a Boolean network called a hybridization, comprising:

enumerating cuts within the Boolean network;

representing, using a computer, a Boolean function of each of the cuts with at least a differential mode threshold logic gate using disjoint Boolean function based decomposition for threshold functions; and

selecting a subset of the cuts to use in order to minimize power or area.

2. The method of claim 1 wherein one or more of the cuts within the Boolean network are rooted at a flipflop.

3. The method of claim 1 wherein representing the Boolean function of each of the cuts comprises replacing the cuts with the at least the differential mode threshold logic gate using backward replacement.

4. The method of claim 1 wherein representing the Boolean function of each of the cuts comprises replacing the cuts with the at least the differential mode threshold logic gate using forward replacement.

5. The method of claim 1 wherein one or more of the cuts within the Boolean network is rooted at a Boolean gate.

6. The method of claim 1 wherein for each of the cuts, replacement of the each of the cuts leads to addition of a flipflop, wherein the flipflop, along with a fanin logic cone for the flipflop, is recursively hybridizable.

7. The method of claim 1 wherein each of the cuts is at least partially implementable with a threshold function.

8. The method of claim 1 further comprising identifying a threshold function by performing Integer Linear Programming (ILP).

Assignments (2)
CONFIRMATORY LICENSE Recorded Apr 1, 2019
From: ARIZONA STATE UNIVERSITY, TEMPE
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 048759/0486 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 28, 2013
From: VRUDHULA, SARMA; KULKARNI, NIRANJAN
To: ARIZONA BOARD OF REGENTS, A BODY CORPORATE OF THE STATE OF ARIZONA, ACTING FOR AND ON BEHALF OF ARIZONA STATE UNIVERSITY
Reel/Frame 030495/0412 →
Continuity (2)
Provisional Application 61651659 · May 25, 2012
Related Publication 20130339914A1 · Dec 19, 2013