TY - JOUR
T1 - The synthesis of complex arithmetic computation on stochastic bit streams using sequential logic
AU - Li, Peng
AU - Lilja, David J
AU - Qian, Weikang
AU - Bazargan, Kia
AU - Riedel, Marc
PY - 2012
Y1 - 2012
N2 - The paradigm of logical computation on stochastic bit streams has several key advantages compared to deterministic computation based on binary radix, including error-tolerance and low hardware area cost. Prior research has shown that sequential logic operating on stochastic bit streams can compute non-polynomial functions, such as the tanh function, with less energy than conventional implementations. However, the functions that can be computed in this way are quite limited. For example, high order polynomials and non-polynomial functions cannot be computed using prior approaches. This paper proposes a new finite-state machine (FSM) topology for complex arithmetic computation on stochastic bit streams. It describes a general methodology for synthesizing such FSMs. Experimental results show that these FSM-based implementations are more tolerant of soft errors and less costly in terms of the area-time product that conventional implementations.
AB - The paradigm of logical computation on stochastic bit streams has several key advantages compared to deterministic computation based on binary radix, including error-tolerance and low hardware area cost. Prior research has shown that sequential logic operating on stochastic bit streams can compute non-polynomial functions, such as the tanh function, with less energy than conventional implementations. However, the functions that can be computed in this way are quite limited. For example, high order polynomials and non-polynomial functions cannot be computed using prior approaches. This paper proposes a new finite-state machine (FSM) topology for complex arithmetic computation on stochastic bit streams. It describes a general methodology for synthesizing such FSMs. Experimental results show that these FSM-based implementations are more tolerant of soft errors and less costly in terms of the area-time product that conventional implementations.
UR - http://www.scopus.com/inward/record.url?scp=84872293536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84872293536&partnerID=8YFLogxK
U2 - 10.1145/2429384.2429483
DO - 10.1145/2429384.2429483
M3 - Conference article
AN - SCOPUS:84872293536
SN - 1092-3152
SP - 480
EP - 487
JO - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
JF - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
M1 - 6386710
T2 - 2012 30th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2012
Y2 - 5 November 2012 through 8 November 2012
ER -