The DOI matches its Crossref record.
Stochastic computing elements and systems
Abstract
To date essentially only two fundamentally different representations of numbers have been used in electronic computers: One is the analog representation by a voltage or current inside a given range, the other one, the digital representation which maps a sequence of 0's and 1's onto a spatial or temporal sequence of voltage or current pulses. Of late, interest has arisen in the use of random pulse sequences as information carriers. (1), (2), (3), (4), (5), (6). It turns out that the use of random pulse sequences leads to the use of digital ANDs or ORs for the fundamental operations of multiplication and summation and therefore to a very considerable reduction in cost of the computational equipment. It is the purpose of this paper to present the theory of these random pulse sequences as well as their practical circuit implementations, and to give some systems design examples. In the final section some non-Von Neumann organizations will be discussed which are made possible by the use of stochastic computing elements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Stochastic computing was first proposed in the 1960s (26,27) but like many concepts proposed ahead of their time it never become mainstream due to the exponential growth of digital computers.”
From Stochastic memristive devices for computing and neuromorphic applications (2013) · cites this paper as [27]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Still being checked.
Cited by
Sorted by citations
Items 101–114 of 114
High-speed simulation of discrete dynamic probabilistic systems
Mars, P., McIntosh, F. G., & Baxter, T. (1979) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(79)90102-2
Living in an Uncertain Universe
Gaines, B. R. (2012) · Studies in fuzziness and soft computing · doi:10.1007/978-3-642-35644-5_50
Hardware Considerations for Signal Processing Systems: A Step Toward the Unconventional.
Knag, P. C. (2015) · Deep Blue (University of Michigan)
Designing Accurate and Low-Cost Stochastic Circuits.
Chen, T.-H. (2016) · Deep Blue (University of Michigan)
Stochastic Computational Approaches for the Reliability Evaluation of Nanoelectronic Circuits
Chen, H. (2012) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3k71x
Automated Synthesis of Unconventional Computing Systems
Hassen, A. U. (2019) · Journal of International Crisis and Risk Communication Research
ReDiSto: A Resource-Efficient and Accurate Divider Circuit for Stochastic Computing
Aftab, M., & Pasha, M. A. (2023) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs58634.2023.10382809
Stochastic Multipliers: from Serial to Parallel
Zhang, Y., Han, J., & Xie, G. (2024) · Springer eBooks · doi:10.1007/978-3-031-42478-6_9
Concerning Multivariate Bernstein Polynomials and Stochastic Logic
Departamento de Matemáticas Universidad Carlos III de Madrid, S., Quintana, Y., & Departamento de Matemáticas Puras y Aplicadas Universidad Simón Bolívar, V. (2024) · Kragujevac Journal of Mathematics · doi:10.46793/kgjmat2503.465q
Approximation of General Functions Using Stochastic Computing
Kind, A. (2025) · Electronics · doi:10.3390/electronics14091845
Dynamic matrix multiplications in memory with photonics and phase-change materials
Cardoso, R. (2024) · theses.fr (ABES) · doi:10.70675/1d6092f1z2c59z4af2z8518z2c4c0a578d32
Metadata
- Authors
- Poppelbaum, W. J., Afuso, C., & Esch, J. W.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Proceedings of the November 14-16, 1967, fall joint computer conference on - AFIPS '67 (Fall)
- Publisher
- ACM Press
- Published
- 1967
- Pages
- 635
- OpenAlex
- W2099690171
- Cited by
- 114
- References
- 0
- Citations by year
- 2025: 3 · 2024: 6 · 2023: 6 · 2022: 13 · 2021: 5 · 2020: 7 · 2019: 10 · 2018: 7 · 2017: 11 · 2016: 8 · 2015: 8 · 2014: 5 · 2013: 5 · 2012: 7
- Type
- conference abstract
- Language
- en
- Open access
- closed
- Locations
- AFIPS Fall Joint Computer Conference (FJCC) (publishedVersion)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Low-power high-performance VLSI design
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
- Keywords
- stochastic computing, random pulse sequences, non-von Neumann architecture, circuit implementation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
