Equivalence Among Stochastic Logic Circuits and its Application to Synthesis | Zendy

Te-Hsuan Chen | Zendy; John P. Hayes | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Equivalence Among Stochastic Logic Circuits and its Application to Synthesis

Author(s) -

Te-Hsuan Chen,

John P. Hayes

Publication year - 2016

Publication title -

ieee transactions on emerging topics in computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.781

H-Index - 46

eISSN - 2376-4562

pISSN - 2168-6750

DOI - 10.1109/tetc.2016.2623796

Subject(s) - boolean function , equivalence (formal languages) , stochastic process , arithmetic function , discrete mathematics , stochastic computing , partition (number theory) , function (biology) , mathematics , computer science , algorithm , arithmetic , combinatorics , statistics , evolutionary biology , computation , biology

Stochastic computing (SC) uses standard logic to process pseudo-random bit-streams denoting probabilities. It implements arith-metic operations by extremely simple and low-power hardware. Despite major new applications, various aspects of SC's theory and design requirements are poorly understood. We observe that the Boolean functions used in SC take the form $f(X)\;= \;f(X_{{\mathrm{V}}};X_{{\math...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research