Transforming probabilities with combinational logic

Weikang Qian, Marc D. Riedel, Hongchao Zhou, Jehoshua Bruck

Research output: Contribution to journalArticlepeer-review

39 Scopus citations


Schemes for probabilistic computation can exploit physical sources to generate random values in the form of bit streams. Generally, each source has a fixed bias and so provides bits with a specific probability of being one. If many different probability values are required, it can be expensive to generate all of these directly from physical sources. This paper demonstrates novel techniques for synthesizing combinational logic that transforms source probabilities into different target probabilities. We consider three scenarios in terms of whether the source probabilities are specified and whether they can be duplicated. In the case that the source probabilities are not specified and can be duplicated, we provide a specific choice, the set 0.4, 0.5; we show how to synthesize logic that transforms probabilities from this set into arbitrary decimal probabilities. Further, we show that for any integer n ≥ 2, there exists a single probability that can be transformed into arbitrary base-n fractional probabilities. In the case that the source probabilities are specified and cannot be duplicated, we provide two methods for synthesizing logic to transform them into target probabilities. In the case that the source probabilities are not specified, but once chosen cannot be duplicated, we provide an optimal choice.

Original languageEnglish (US)
Article number5989992
Pages (from-to)1279-1292
Number of pages14
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Issue number9
StatePublished - Sep 1 2011


  • Logic synthesis
  • probabilistic logic
  • probabilistic signals
  • random bit streams
  • stochastic bit streams

Fingerprint Dive into the research topics of 'Transforming probabilities with combinational logic'. Together they form a unique fingerprint.

Cite this