首页> 外文会议>ACM Great Lakes Symposium on VLSI >Computing complex functions using factorization in unipolar stochastic logic
【24h】

Computing complex functions using factorization in unipolar stochastic logic

机译:在单极随机逻辑中使用因式分解来计算复杂函数

获取原文

摘要

This paper addresses computing complex functions using unipolar stochastic logic. Stochastic computing requires simple logic gates and is inherently fault-tolerant. Thus, these structures are well suited for nanoscale CMOS technologies. Implementations of complex functions cost extremely low hardware complexity compared to traditional two's complement implementation. In this paper an approach based on polynomial factorization is proposed to compute functions in unipolar stochastic logic. In this approach, functions are expressed using polynomials, which are derived from Taylor expansion or Lagrange interpolation. Polynomials are implemented in stochastic logic by using factorization. Experimental results in terms of accuracy and hardware complexity are presented to compare the proposed designs of complex functions with previous implementations using Bernstein polynomials.
机译:本文介绍了使用单极随机逻辑计算复杂函数的方法。随机计算需要简单的逻辑门,并且具有固有的容错能力。因此,这些结构非常适合于纳米级CMOS技术。与传统的二进制补码实现相比,实现复杂功能所需的硬件复杂度极低。本文提出了一种基于多项式因式分解的方法来计算单极随机逻辑中的函数。在这种方法中,函数是使用多项式表示的,这些多项式是从泰勒展开式或拉格朗日插值法得出的。多项式通过使用因式分解以随机逻辑的形式实现。给出了准确性和硬件复杂性方面的实验结果,以将建议的复杂函数设计与使用伯恩斯坦多项式的先前实现进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号