1 / 22

220 likes | 427 Views

Probabilistic CMOS & Probabilistic Boolean Logic. Zheng -Shan Yu & Ching - Yi H uang 2012/07/17. Outline. PCMOS CMOS with noise CMOS with varying voltages Correctness v.s . energy Relations between PBF, PBTT, and PBC PBL optimization Problem Future work. CMOS with noise. NOT:.

Download Presentation
## Probabilistic CMOS & Probabilistic Boolean Logic

**An Image/Link below is provided (as is) to download presentation**
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.
Content is provided to you AS IS for your information and personal use only.
Download presentation by click this link.
While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

**Probabilistic CMOS & Probabilistic Boolean Logic**Zheng-Shan Yu & Ching-Yi Huang 2012/07/17**Outline**• PCMOS • CMOS with noise • CMOS with varying voltages • Correctness v.s. energy • Relations between PBF, PBTT, and PBC • PBL optimization • Problem • Future work**CMOS with noise**• NOT:**CMOS with noise (cont.)**• Noise: • Interconnection noise • Crosstalk • Simultaneous switching noise • Thermal noise • Noise models of PCMOS:**CMOS with varying voltages**• Many voltage regulators are required if an application requires many different probabilities. • It is much better that the number of probabilities is small. With noise Without noise**Correctness v.s. energy**• It is much better that the number of probabilistic gates is large.**Relations between PBF, PBTT, and PBC (1/5)**• ((A∧B)∨(B∧C))∨3/4(A∧C) PBF PBC PBTT**Relations between PBF, PBTT, and PBC (2/5)**• ((A∧B)∨(B∧C))∨3/4(A∧C) PBF PBC**Relations between PBF, PBTT, and PBC (3/5)**• o1 = (n1 ∧4/5 n1) • n1 = (~2/3a) • o1=((~2/3a)∧4/5(~2/3a)) PBF PBC with reconvergentfanout o1 n1**Relations between PBF, PBTT, and PBC (4/5)**• ((A∧B)∨(B∧C))∨3/4(A∧C) PBF • NOT: • Pout = (1 – Pin)*p + Pin*(1 – p) • OR: • Pout = (1 – Pa)*(1 – Pb)*(1 – p) + (1 – Pa)*Pb*p + Pa*(1 – Pb)*p + Pa*Pb*p • AND: • Pout = (1 – Pa)*(1 – Pb)*(1 – p) + (1 – Pa)*Pb*(1 – p) + Pa*(1 – Pb)*(1 – p) + Pa*Pb*p PBTT**Relations between PBF, PBTT, and PBC (5/5)**• ((A∧B)∨(B∧C))∨3/4(A∧C) PBF PBTT**PBL optimization (1/8)**• (A ∧ 3/4 B) • ( (A’B’)’)∧ (A’B’) + ( (A’B)’)∧ (A’B) + ( (AB’)’)∧ (AB’) + ( (AB)’)∧ (AB) A B**PBL optimization (2/8)**• Associativity: • ((A∧ pB)∧pC) ≠ (A ∧ p(B ∧pC)) • Distributivity: • (A∧ r B)∨p(A∧rC) ≠ A ∧ r(B ∨pC)**PBL optimization (3/8)**• Step1: Optimize deterministic cubes • ((A’B’ + A’B + AB’)’)∧ (A’B’ + A’B + AB’)) => (((AB)’)’)∧ ((AB)’) • ( (AB)’)∧ (AB)**PBL optimization (4/8)**• Step2: Re-arrange probabilities • (((AB)’)’)∧ ((AB)’) • => ((AB)’)∧ ((AB)’) • ( (AB)’)∧ (AB)**PBL optimization (5/8)**• Step3: Merge probabilistic cubes • ((AB)’)∧ ((AB)’) • ( (AB)’)∧ (AB) • Combine : • ( (AB)’)∧ ((AB)’ + AB) • => ( (AB)’) • => (((AB))) • => (((A ∧ 3/4 B))) • Goal: (A ∧ 3/4 B)**PBL optimization (6/8)**• Step1: Optimize deterministic cubes • Conventional logic optimization • Step2: Re-arrange probabilities 1 =pq+(1-p)(1-q)**PBL optimization (7/8)**• Step3: Merge probabilistic cubes • ( (AB)’)∧ ((AB)’) • ( (AB)’)∧ (AB) Mutually exclusive A B A B A B**PBL optimization (8/8)**• Step3: Merge probabilistic cubes • ( (AB)’)∧ ((AB)’) • ( (AB)’)∧ (AB) • ( (AB)’)∧ ((AB)’ ∨AB) A B A B**Problem**• PBL optimization**Future work**• Assign probabilistic gates for error-tolerant designs • Testibility • Observability • Controllability**Future work (cont.)**• Compute the output probability under an input assignment • Monte Carlo Simulation • Deterministic methods

More Related