Content deleted Content added
m task, replaced: Electronic Letters → Electronics Letters (2) |
Citation bot (talk | contribs) m Alter: journal, title, template type. Add: citeseerx, isbn, pages, issue, volume, journal, doi. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | User-activated. |
||
Line 52:
| first3=J.
| title=Stochastic computing elements and systems
| journal=
| volume=31
| pages=635–644
Line 62:
| first=B.
| title=Stochastic Computing
| journal=
| year=1967
| volume=30
Line 129:
correcting codes.<ref>
{{cite journal
| title=Iterative decoding
| last1=Gaudet
| first1=Vincent
Line 139:
| pages=299–301
|date=February 2003
| doi=10.1049/el:20030217
}}
</ref> More recently, stochastic circuits have been successfully used in [[image processing]] tasks such as [[edge detection]]
<ref>{{Cite book | last1 = Alaghi | first1 = A. | last2 = Li | first2 = C. | last3 = Hayes | first3 = J. P. | doi = 10.1145/2463209.2488901 | chapter = Stochastic circuits for real-time image-processing applications | title = Proceedings of the 50th Annual Design Automation Conference on - DAC '13 | pages = 1 | year = 2013 | isbn = 9781450320719 | pmid = | pmc = }}</ref> and [[Thresholding (image processing)|image thresholding]].<ref>{{Cite book | last1 = Najafi| first1 = M. H. | last2 = Salehi | first2 = M. E. | doi = 10.1109/TVLSI.2015.2415932 | chapter = A Fast Fault-Tolerant Architecture for Sauvola Local Image Thresholding Algorithm Using Stochastic Computing | title = IEEE Transactions on Very Large Scale Integration (VLSI) Systems - TVLSI '16 |
== Strengths and weaknesses ==
Line 174 ⟶ 175:
Circuits work properly even when the inputs are misaligned temporally. As a result, stochastic
systems can be designed to work with inexpensive locally generated clocks instead of using a global clock and
an expensive clock distribution network.<ref>{{Cite
Finally, stochastic computing provides an estimate of the solution
Line 181 ⟶ 182:
referred to as ''progressive precision'', which suggests that the precision
of stochastic numbers (bit streams) increases as computation proceeds.
<ref>{{Cite journal | last1 = Alaghi | first1 = A. | last2 = Hayes | first2 = J. P. | doi = 10.1145/2465787.2465794 | title = Survey of Stochastic Computing | journal = ACM Transactions on Embedded Computing Systems | volume = 12 | issue = 2s | pages = 1 | year = 2013 | pmid = | pmc = | citeseerx = 10.1.1.296.4448 }}</ref>
It is as if the [[most significant bit]]s of the number
arrive before its [[least significant bit]]s; unlike the
Line 271 ⟶ 272:
modeled very simply with stochastic computing.<ref>
{{cite journal
| title=Iterative decoding
| last1=Gaudet
| first1=Vincent
Line 281 ⟶ 282:
| pages=299–301
|date=February 2003
| doi=10.1049/el:20030217
}}
</ref>
Line 338 ⟶ 340:
==Further reading==
* {{cite journal|url=http://pages.cpsc.ucalgary.ca/~gaines/reports/COMP/IdentSC/IdentSC.pdf|title=Techniques of Identification with the Stochastic Computer|last=Gaines|first=Brian R. |journal=Proceedings IFAC Symposium on "The Problems of Identification in Automatic Control Systems", Section 6 Special Identification Instruments, Prague June 12–19, 1967|year=1967|accessdate=2013-11-11}}
* {{cite journal|url=http://homes.cs.washington.edu/~armin/ACM_TECS_2013.pdf|title=Survey of Stochastic Computing|last1=Alaghi|first1=Armin|last2=Hayes|first2=John P.|journal=ACM Transactions on Embedded Computing Systems|volume=12|issue=2s|pages=1–19|year=2013|accessdate=2013-11-11|doi=10.1145/2465787.2465794|citeseerx=10.1.1.296.4448}}
[[Category:History of computing hardware]]
|