1 / 20

Correctness Analysis for Probabilistic Boolean Circuits

Correctness Analysis for Probabilistic Boolean Circuits. Zheng -Shan Yu & Ching - Yi Huang & Yung-Chun Hu 2013/02/25. Outline. Introduction Error tolerant circuit PCMOS Output correctness calculations Probabilistic formulae Exhausted simulation Monte Carlo simulation

emile
Download Presentation

Correctness Analysis for Probabilistic Boolean Circuits

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

Presentation Transcript

  1. Correctness Analysis for Probabilistic Boolean Circuits Zheng-Shan Yu & Ching-Yi Huang & Yung-Chun Hu 2013/02/25

  2. Outline • Introduction • Error tolerant circuit • PCMOS • Output correctness calculations • Probabilistic formulae • Exhausted simulation • Monte Carlo simulation • Circuit correctness • Experimental results • Future work

  3. Error Tolerant Circuit • Circuits that don’t acquire 100% correctness • Human perception is limited. • Applications • Graph • Audio • Video • … • How to implement error tolerant circuits? • Circuit simplification • PMOS • … Origin PSNR=31.79

  4. 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. CMOS PCMOS

  5. Correctness v.s. energy • It is much better that the number of probabilistic gates is large.

  6. Probabilistic formulae • NOT: Pout= (1–Pin)*p + Pin*(1–p) • AND: Pout= Pa*Pb*p + (1 – Pa*Pb)*(1–p) • OR: Pout = (1–Pa)*(1–Pb)*(1–p) + [1–(1–Pa)*(1–Pb)]*p • P(n) = 1*1*0.8 + 0*0*0.2 = 0.8 • P(m) = 0*0.8 + 1*0.2 = 0.2 • P(u) = 0.2*0.8*0.3 + (1-0.8*0.2)*0.7 = 0.636 Note : Pout = probability of 1 1 n 0.8 1 0.7 u 0.8 1 m

  7. Probabilistic formulae • Advantages: • The fastest method • Compute exact answers • Disadvantages: • Cannot deal with circuits with internal reconvergent signals Example Pout = Pa*Pb*p + (1 – Pa*Pb)*(1–p) = 0.9*0.9*0.8 + (1-0.9*0.9)*(1-0.8) = 0.686 0.9 0.8 Pout Pout= 0.9*1*0.8 + (1-0.9*1)*(1-0.8) = 0.8

  8. Exhausted simulation • List all combinations of probabilistic gates evaluating correctly or not • Sum the probability of each combination 1 n 0.8 1 0.7 u 1 0.8 m

  9. Exhausted simulation • Advantages: • Can deal with all circuits • Compute exact answers • Disadvantages: • The slowest method

  10. Monte Carlo Method • How to compute the area of this quarter circle if we do not know the function ?

  11. Monte Carlo simulation • Simulate until reaching the stop point RPG 1 n 0.8 1 0.7 u 0.8 1 ‧ ‧ ‧ m ‧ ‧

  12. Monte Carlo simulation Stop point # # t distribution Probability of 1 Probability of 1 Normal distribution

  13. Monte Carlo simulation • Advantages: • Can deal with large circuits efficiently • Disadvantages: • Compute approximate answers

  14. Circuit Correctness But this method calculate output correctness of only one input combination at a time RPG 1 n 0.8 1 0.7 u 0.8 1 ‧ ‧ ‧ m

  15. Method I Probability of 1 Can’t apply montecarlo method!! . . . . . .

  16. Method I Probability of 1 Correctness . . . . . . . . .

  17. Method II 0.5 0.5 0.5 Correctness

  18. Experimental Results A 0.9 B 0.9 C 0.9 Circuit correctness: 0.7448

  19. Experimental Results

  20. Future work • Reorganize the paper with new idea.

More Related