Cited by 114Low-power high-performance VLSI designError Correcting Code TechniquesAdvanced Memory and Neural Computing

Stochastic computing elements and systems

Poppelbaum, W. J., Afuso, C., Esch, J. W.·1967·Proceedings of the November 14-16, 1967, fall joint computer conference on - AFIPS '67 (Fall)

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1465611.1465696

Cites

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Stochastic computing was first proposed in the 1960s but never became mainstream due to the exponential growth of digital computers.

    “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.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Still being checked.

Cited by

Sorted by citations

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