Synthesis of polynomial functions

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter addresses the fundamental question: what functions can stochastic logic compute? We show that, given stochastic inputs, any combinational circuit computes a polynomial function. Conversely, we show that, given any polynomial function, we can synthesize stochastic logic to compute this function. The only restriction is that we must have a function that maps the unit interval [0, 1] to the unit interval [0, 1], since the stochastic inputs and outputs are probabilities. Our approach is both general and efficient in terms of area. It can be used to synthesize arbitrary polynomial functions. Through polynomial approximations, it can also be used to synthesize non-polynomial functions.

Cite

CITATION STYLE

APA

Riedel, M., & Qian, W. (2019). Synthesis of polynomial functions. In Stochastic Computing: Techniques and Applications (pp. 103–120). Springer International Publishing. https://doi.org/10.1007/978-3-030-03730-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free