Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009
DOI: 10.1145/1531542.1531615
|View full text |Cite
|
Sign up to set email alerts
|

A reconfigurable stochastic architecture for highly reliable computing

Abstract: Mounting concerns over variability, defects and noise motivate a new approach for integrated circuits: the design of stochastic logic, that is to say, digital circuitry that operates on probabilistic signals, and so can cope with errors and uncertainty. Techniques for probabilistic analysis are well established. We advocate a strategy for synthesis. In this paper, we present a reconfigurable architecture that implements the computation of arbitrary continuous functions with stochastic logic. We analyze the sou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(30 citation statements)
references
References 12 publications
0
30
0
Order By: Relevance
“…The stochastic number's value p is carried by the number of 1s in its bit-stream form, so it suffices to count these 1s in order to extract p. Figure 3(b) shows a counter that performs this conversion. Figure 4 shows a stochastic circuit that implements the arithmetic function z = [Li et al 2009]. The inputs x 1 , x 2 , x 3 , and x 4 are provided in conventional binary form and must be converted to stochastic numbers via SNGs.…”
Section: Basic Conceptsmentioning
confidence: 99%
“…The stochastic number's value p is carried by the number of 1s in its bit-stream form, so it suffices to count these 1s in order to extract p. Figure 3(b) shows a counter that performs this conversion. Figure 4 shows a stochastic circuit that implements the arithmetic function z = [Li et al 2009]. The inputs x 1 , x 2 , x 3 , and x 4 are provided in conventional binary form and must be converted to stochastic numbers via SNGs.…”
Section: Basic Conceptsmentioning
confidence: 99%
“…In stochastic logic, inputs are vectors in which the number of 1 in each vector represents the given probability and computations are performed using logical hardware gates. Vectors can process each gate in serial or in parallel [26] and these values provide the corresponding probability of the inputs [28]. The values of stochastic logic are binary [29], which means that the probability is provided by dividing the number of 1-value bits by the total number of bits in the stream [26].…”
Section: Fault Tree Analysis Based On Stochastic Logicmentioning
confidence: 99%
“…If the inputs of the AND gate are bits, it will AND the bits logically as the stochastic logic [28]. In an OR gate, one input or more must fail to make the top event of the gate to occur [6].…”
Section: Static Fault Treementioning
confidence: 99%
“…5 [34]. The randomization cost presents a significant overhead in stochastic computing, sometimes as high as 80% of the total resource usage [35].…”
Section: Stochastic Computing: Preliminaries and Challengesmentioning
confidence: 99%
“…Despite the slow progress, continued research has made the following advances: 1) a large collection of logic, arithmetic, and matrix operations can now be done in stochastic computing [34]- [39], all of which share the elegance of very simple designs and 2) special applications, including artificial neural networks [40]- [42], image processing [35], [43], and decoding of low-density parity-check codes [44], [45] have been successfully demonstrated using stochastic computing. Note the common characteristics among these special applications: 1) error-tolerant and 2) compute-intensive, and the low-cost stochastic computing promises substantial reduction in complexity.…”
Section: Stochastic Computing: Preliminaries and Challengesmentioning
confidence: 99%