RFRafatul Faria

Rafatul Faria

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Rafatul Faria has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Autonomous Probabilistic Coprocessing With Petaflips per Second

    by Brian Sutton, Rafatul Faria, Lakshmi Anirudh Ghantasala, Risi Jaiswal, Kerem Yunus Camsari, Supriyo Datta

    In this paper we present a concrete design for a probabilistic (p-) computer based on a network of p-bits, robust classical entities fluctuating between -1 and +1, with probabilities that are controlled through an input constructed from the outputs of other p-bits. The architecture of this probabilistic computer is similar to a stochastic neural network with the p-bit playing the role of a binary stochastic neuron, but with one key difference: there is no sequencer used to enforce an ordering of p-bit updates, as is typically required. Instead, we explore sequencerless designs where all p-bits are allowed to flip autonomously and demonstrate that such designs can allow ultrafast operation unconstrained by available clock speeds without compromising the solution’s fidelity. Based on experimental results from a hardware benchmark of the autonomous design and benchmarked device models, we project that a nanomagnetic implementation can scale to achieve petaflips per second with millions of neurons. A key contribution of this paper is the focus on a hardware metric – flips per second– as a problem and substrate-independent figure-of-merit for an emerging class of hardware annealers known as Ising Machines. Much like the shrinking feature sizes of transistors that have continually driven Moore’s Law, we believe that flips per second can be continually improved in later technology generations of a wide class of probabilistic, domain specific hardware.


  • Open Access

    Hardware Design for Autonomous Bayesian Networks

    by Rafatul Faria, Jan Kaiser, Kerem Y. Camsari, Supriyo Datta

    Directed acyclic graphs or Bayesian networks that are popular in many AI related sectors for probabilistic inference and causal reasoning can be mapped to probabilistic circuits built out of probabilistic bits (p-bits), analogous to binary stochastic neurons of stochastic artificial neural networks. In order to satisfy standard statistical results, individual p-bits not only need to be updated sequentially, but also in order from the parent to the child nodes, necessitating the use of sequencers in software implementations. In this article, we first use SPICE simulations to show that an autonomous hardware Bayesian network can operate correctly without any clocks or sequencers, but only if the individual p-bits are appropriately designed. We then present a simple behavioral model of the autonomous hardware illustrating the essential characteristics needed for correct sequencer-free operation. This model is also benchmarked against SPICE simulations and can be used to simulate large scale networks. Our results could be useful in the design of hardware accelerators that use energy efficient building blocks suited for low-level implementations of Bayesian networks. The autonomous massively parallel operation of our proposed stochastic hardware has biological relevance since neural dynamics in brain is also stochastic and autonomous by nature.

  • Low-Barrier Magnet Design for Efficient Hardware Binary Stochastic Neurons

    by Orchi Hassan, Rafatul Faria, Kerem Yunus Camsari, Jonathan Z. Sun, Supriyo Datta

    Binary stochastic neurons (BSNs) form an integral part of many machine learning algorithms, motivating the development of hardware accelerators for this complex function. It has been recognized that hardware BSNs can be implemented using low-barrier magnets (LBMs) by minimally modifying present-day magnetoresistive random-access memory (MRAM) devices. A crucial parameter that determines the response of these LBM-based BSN designs is the correlation time of magnetization $\tau _c$ . In this letter, we show that, for magnets with low-energy barriers ( $\Delta \approx k_BT$ and below), circular disk magnets with in-plane magnetic anisotropy (IMA) lead to $\tau _c$ values that are two orders of magnitude smaller than $\tau _c$ of magnets with perpendicular magnetic anisotropy (PMA). Analytical descriptions demonstrate that this striking difference in $\tau _c$ is due to a precessionlike fluctuation mechanism that is enabled by the large demagnetization field in IMA magnets. We provide a detailed energy-delay performance evaluation of previously proposed BSN designs based on spin-orbit torque MRAM and spin-transfer torque MRAM employing low-barrier circular IMA magnets by SPICE simulations. The designs exhibit subnanosecond response times leading to energy requirements of approximately a few femtojoules to evaluate the BSN function, orders of magnitude lower than digital CMOS implementations with a much larger surface area. While modern MRAM technology is based on PMA magnets, results in this letter suggest that low-barrier circular IMA magnets may be more suitable for this application.


  • Design of Stochastic Nanomagnets for Probabilistic Spin Logic

    by Punyashloka Debashis, Rafatul Faria, Kerem Yunus Camsari, Zhihong Chen

    Probabilistic spin logic (PSL) is a new paradigm of computing that relies on probabilistic bits, or p-bits, that fluctuate randomly between their metastable states. It has been shown that PSL can implement new functionalities such as intrinsic optimization, Bayesian inference, invertible Boolean logic and hardware machine learning more efficiently than conventional CMOS based logic. The building block of PSL is a p-bit, which is essentially a tunable random number generator. One of the natural ways to implement p-bits is by using stochastic nanomagnets that fluctuate randomly between their stable states and can be made to prefer one state over others by an external input such as voltage or current. This paper looks at the design of stochastic nanomagnets that are most suitable as p-bits for PSL. Experimental evidence, supported by theory and numerical simulation, show that scaling magnetic anisotropy is more effective than scaling net magnetic moment for voltage driven PSL applications. Finally, a novel system is experimentally demonstrated and theoretically analyzed that can be used as a tunable random number generator: a PMA magnet initialized to its hard axis by GSHE torque. With zero external input, this system provides a potentially better alternate to other nanomagnet based random number generators. By tuning the randomness through an external input, this system is suited for probabilistic networks for Bayesian inference.


  • Open Access

    Implementing Bayesian networks with embedded stochastic MRAM

    by Rafatul Faria, Kerem Y. Camsari, Supriyo Datta

    Magnetic tunnel junctions (MTJ’s) with low barrier magnets have been used to implement random number generators (RNG’s) and it has recently been shown that such an MTJ connected to the drain of a conventional transistor provides a three-terminal tunable RNG or a p-bit. In this letter we show how this p-bit can be used to build a p-circuit that emulates a Bayesian network (BN), such that the correlations in real world variables can be obtained from electrical measurements on the corresponding circuit nodes. The p-circuit design proceeds in two steps: the BN is first translated into a behavioral model, called Probabilistic Spin Logic (PSL), defined by dimensionless biasing (h) and interconnection (J) coefficients, which are then translated into electronic circuit elements. As a benchmark example, we mimic a family tree of three generations and show that the genetic relatedness calculated from a SPICE-compatible circuit simulator matches well-known results.


  • Open Access

    Low Barrier Nanomagnets as p-bits for Spin Logic

    by Rafatul Faria, Kerem Yunus Camsari, Supriyo Datta

    It has recently been shown that a suitably interconnected network of tunable telegraphic noise generators or "p-bits" can be used to perform even precise arithmetic functions like a 32-bit adder. In this paper we use simulations based on the stochastic Landau-Lifshitz-Gilbert (sLLG) equation to demonstrate that similar impressive functions can be performed using unstable nanomagnets with energy barriers as low as a fraction of a kT. This is surprising since the magnetization of low barrier nanomagnets is not telegraphic with discrete values of +1 and -1. Rather it fluctuates randomly among all values between -1 and +1, and the output magnets are read with a thresholding device that translates all positive values to 1 and all negative values to zero. We present sLLG-based simulations demonstrating the operation of a 32-bit adder with a network of several hundred nanomagnets, exhibiting a remarkably precise correlation: The input magnets {A} and {B} as well as the output magnets {S} all fluctuate randomly and yet the quantity A+B-S is sharply peaked around zero! If we fix {A} and {B}, the sum magnets {S} rapidly converge to a unique state with S=A+B so that the system acts as an adder. But unlike standard adders, the operation is invertible. If we fix {S} and {B}, the remaining magnets {A} converge to the difference A=S-B. These examples suggest a new direction for the field of nanomagnetics away from stable high barrier magnets towards stochastic low barrier magnets which not only operate with lower currents, but are also more promising for continued downscaling.