返回
Recursive Algorithms in Memristive Logic Arrays
DOI:10.1109/JETCAS.2015.2435531.png)
摘要
En 中文
In memristive stateful logic memristors store logic values as their memristance states and perform logical operations on them. This form of logic has been studied intensively since it was first empirically demonstrated in the work of Borghetti et al., 2010. It has been previously noted that substantial parallelism in stateful computation is required to make this form of logic competetive with conventional logic computing paradigms. In this work we show how a certain class of vectorized recursive algorithms can be computed in a semiconductor/memristor hybrid array structure. This class of algorithms allows efficient computation of many practically important vector operations; examples considered in this paper include the binary sum of vectors, the parity of a vector, and the Hamming weight of a vector. We present theoretical analysis of the time and space complexity of this class of operations, and show examples of this computing method using circuit-level simulations. We also discuss possible applications of these operations in massively parallel memristive array computing.
Keyword:
Digital arithmetic
hybrid integrated circuits
memristors
parallel architectures
parallel processing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.4K
被引数:
2.8K
机构
引用论文
Variations on hormone replacement therapy: An answer to the ‘one dose fits all’ Women's Health Initiative study激素替代疗法的变化: “一剂适合所有” 妇女健康倡议研究的答案

