Invention Grant
US09319047B2 Computation of boolean formulas using sneak paths in crossbar computing
有权
在横向计算中使用潜行路径计算布尔公式
- Patent Title: Computation of boolean formulas using sneak paths in crossbar computing
- Patent Title (中): 在横向计算中使用潜行路径计算布尔公式
-
Application No.: US14573677Application Date: 2014-12-17
-
Publication No.: US09319047B2Publication Date: 2016-04-19
- Inventor: Sumit Kumar Jha , Dilia E. Rodriguez , Joseph E. Van Nostrand , Alvaro Velasquez
- Applicant: UNIVERSITY OF CENTRAL FLORIDA RESEARCH FOUNDATION, INC.
- Applicant Address: US FL Orlando
- Assignee: UNIVERSITY OF CENTRAL FLORIDA RESEARCH FOUNDATION, INC.
- Current Assignee: UNIVERSITY OF CENTRAL FLORIDA RESEARCH FOUNDATION, INC.
- Current Assignee Address: US FL Orlando
- Agency: Preti Flaherty Beliveau & Pachios LLP
- Main IPC: H03K19/0175
- IPC: H03K19/0175 ; H03K19/08 ; H03K19/173

Abstract:
Memristor-based nano-crossbar computing is a revolutionary computing paradigm that does away with the traditional Von Neumann architectural separation of memory and computation units. The computation of Boolean formulas using memristor circuits has been a subject of several recent investigations. Crossbar computing, in general, has also been a topic of active interest, but sneak paths have posed a hurdle in the design of pervasive general-purpose crossbar computing paradigms. Various embodiments are disclosed which demonstrate that sneak paths in nano-crossbar computing can be exploited to design a Boolean-formula evaluation strategy. Such nano-crossbar designs are also an effective approach for synthesizing high performance customized arithmetic and logic circuits.
Public/Granted literature
- US20150171868A1 COMPUTATION OF BOOLEAN FORMULAS USING SNEAK PATHS IN CROSSBAR COMPUTING Public/Granted day:2015-06-18
Information query
IPC分类: