DocumentCode
581002
Title
The synthesis of complex arithmetic computation on stochastic bit streams using sequential logic
Author
Li, Peng ; Lilja, David J. ; Qian, Weikang ; Bazargan, Kia ; Riedel, Marc
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear
2012
fDate
5-8 Nov. 2012
Firstpage
480
Lastpage
487
Abstract
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.
Keywords
digital arithmetic; fault tolerance; finite state machines; integrated circuit reliability; logic design; sequential circuits; topology; FSM-based implementations; area-time product; complex arithmetic computation; error tolerance; finite state machine topology; hardware area cost; logical computation; nonpolynomial functions; sequential logic; stochastic bit streams; Encoding; Fault tolerance; Fault tolerant systems; Hardware; Multiplexing; Polynomials; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design (ICCAD), 2012 IEEE/ACM International Conference on
Conference_Location
San Jose, CA
ISSN
1092-3152
Type
conf
Filename
6386710
Link To Document