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. 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.

Notes

This item is only available to users on the UCF campus. If this is your Honors thesis, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu

Thesis Completion

2014

Semester

Spring

Advisor

Jha, Sumit Kumar

Degree

Bachelor of Science (B.S.)

College

College of Engineering and Computer Science

Department

Electrical Engineering and Computer Science

Subjects

Dissertations, Academic -- Engineering and Computer Science; Engineering and Computer Science -- Dissertations, Academic

Format

PDF

Identifier

CFH0004571

Language

English

Access Status

Campus-only Access

Length of Campus-only Access

5 years

Document Type

Honors in the Major Thesis

Share

COinS