This brief addresses computing polynomials with all positive coefficients whose sum is less than or equal to one using unipolar stochastic logic. The contributions of this brief are twofold. First, we present novel approaches to expanding polynomials that can be implemented using multiplexers in unipolar stochastic logic. These expansions are based on ascending-order, and Horner's rule based on descending-order. It is shown that the Horner's rule expansion is equivalent to OR-AND expansion. We also present another new expansion, referred as AND-OR. These expansions have not been presented in any prior work. Second, we also show that the proposed AND-OR expansion is logically equivalent to the prior double-NAND expansion. Furthermore, we show that the OR-AND circuits can be transformed into equivalent double-NOR circuits.
|Original language||English (US)|
|Number of pages||5|
|Journal||IEEE Transactions on Circuits and Systems II: Express Briefs|
|State||Published - Nov 2018|
Bibliographical noteFunding Information:
Manuscript received July 29, 2017; accepted September 21, 2017. Date of publication September 26, 2017; date of current version October 29, 2018. This work was supported by the National Science Foundation under Grant CCF-1319107. This brief was recommended by Associate Editor W. N. N. Hung.
© 2004-2012 IEEE.
Copyright 2018 Elsevier B.V., All rights reserved.
- AND-OR expansion
- Horner's expansion
- OR-AND expansion
- Stochastic logic
- ascending-order expansion
- double-NAND expansion
- polynomial expansion
- tree expansion