You are here
COMPUTATION OF BOOLEAN FORMULAS USING SNEAK PATHS IN CROSSBAR COMPUTING
| Title: | COMPUTATION OF BOOLEAN FORMULAS USING SNEAK PATHS IN CROSSBAR COMPUTING. |
 67 views 41 downloads |
|---|---|---|
| Name(s): |
Velasquez, Alvaro, Author Jha, Sumit, Committee Chair University of Central Florida, Degree Grantor |
|
| Type of Resource: | text | |
| Date Issued: | 2014 | |
| Publisher: | University of Central Florida | |
| Language(s): | English | |
| Abstract/Description: | 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. In this paper, we demonstrate that sneak paths in nano-crossbar computing can be exploited to design a Boolean-formula evaluation strategy. We demonstrate our approach on a simple Boolean formula and a 1-bit addition circuit. We also conjecture that our nano-crossbar design will be an effective approach for synthesizing high-performance customized arithmetic and logic circuits. | |
| Identifier: | CFH0004571 (IID), ucf:45163 (fedora) | |
| Note(s): |
2014-05-01 B.S. Engineering and Computer Science, Dept. of Electrical Engineering and Computer Science Bachelors This record was generated from author submitted information. |
|
| Subject(s): |
memristor crossbar computing emerging technology nanoscale computing |
|
| Persistent Link to This Record: | http://purl.flvc.org/ucf/fd/CFH0004571 | |
| Restrictions on Access: | campus 2019-04-01 | |
| Host Institution: | UCF |
