首页> 外文会议>International Symposium on Embedded Computing and System Design >Fast In-Memory Computation of Boolean Functions in Memristive Crossbar Array
【24h】

Fast In-Memory Computation of Boolean Functions in Memristive Crossbar Array

机译:Memristive CrossBar数组中的Boolean函数的快速内存计算

获取原文

摘要

Modern computing paradigms like in-memory computing have increasingly become popular among emerging non-volatile memories such as memristor. In this paper, a synthesis approach using the MAGIC design style has been proposed to map two-level Boolean functions in memristive crossbar array. The proposed synthesis approach exploits parallelism offered by the crossbar array to reduce latency. Our evaluation shows that though this approach consumes more area; however, the delay is reduced to a great extent. The method results in a design that is faster as compared to existing stateful logic designs as demonstrated for an N-bit adder. SPICE simulation has been performed to estimate delay and energy requirements. Results have been compared with some recent works on MCNC benchmark functions.
机译:现代计算范例如内存计算越来越受到诸如忆故忆的新兴的非易失性存储器中的流行。在本文中,已经提出了一种使用魔术设计风格的合成方法来映射Memristive CrossBar阵列中的两级布尔函数。所提出的综合方法利用横梁阵列提供的并行性以减少延迟。我们的评估表明,虽然这种方法消耗了更多区域;然而,延迟在很大程度上减少。与现有的状态逻辑设计相比,该方法导致设计更快,如对于N位加法器所示。 Spice仿真已经进行了估算延迟和能量要求。将结果与MCNC基准功能的一些最新作品进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号