arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.04166cs.ET
收藏

概率电路FPGA实现中的加权p比特

Weighted p-bits for FPGA implementation of probabilistic circuits

Ahmed Zeeshan Pervaiz, Brian M. Sutton, Lakshmi Anirudh Ghantasala, Kerem Y. Camsari

摘要:

概率自旋逻辑(Probabilistic spin logic,PSL)是最近提出的一种计算范式,它基于称为概率位(probabilistic bits,p-bits)的不稳定随机单元,这些单元可以相互关联以形成概率电路(probabilistic circuits,p-circuits)。这些p-电路可以用来解决优化、推理的问题,也可以在“反向”模式下实现精确的布尔函数,其中给定的布尔电路可以反向操作以找到与给定输出一致的输入组合。在本文中,我们提出了一个可扩展的FPGA实现这样的可逆p-电路。我们实现了一个“加权”的p位,结合随机单位与本地化的内存结构。我们还提出了一个广义瓦片的加权p位的一大类可逆布尔逻辑以外的问题可以映射,以及如何可逆性可以应用到有趣的问题,如NP-完全子集求和问题,通过解决这个问题的一个小实例在硬件。

英文摘要:

Probabilistic spin logic (PSL) is a recently proposed computing paradigm based on unstable stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic circuits (p-circuits). These p-circuits can be used to solve problems of optimization, inference and also to implement precise Boolean functions in an "inverted" mode, where a given Boolean circuit can operate in reverse to find the input combinations that are consistent with a given output. In this paper we present a scalable FPGA implementation of such invertible p-circuits. We implement a "weighted" p-bit that combines stochastic units with localized memory structures. We also present a generalized tile of weighted p-bits to which a large class of problems beyond invertible Boolean logic can be mapped, and how invertibility can be applied to interesting problems such as the NP-complete Subset Sum Problem by solving a small instance of this problem in hardware.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑