Sparse Random Signals for Fast Convergence on Invertible Logic

Sparse Random Signals for Fast Convergence on Invertible Logic

This paper introduces sparse random signals for fast convergence on invertible logic. Invertible logic based on a network of probabilistic nodes (spins), similar to a Boltzmann machine, can compute functions bidirectionally by reducing the network energy to the global minimum with the addition of ra...

Full description

Bibliographic Details
Main Authors: Naoya Onizawa, Makoto Kato, Hitoshi Yamagata, Koji Yano, Seiichi Shin, Hiroyuki Fujita, Takahiro Hanyu
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Stochastic computing
Boltzmann machine
bidirectional operations
Online Access:https://ieeexplore.ieee.org/document/9399449/

Internet

https://ieeexplore.ieee.org/document/9399449/

Similar Items