ECE 595Z Lecture 7: Two-level Logic Synthesis II

By Anand Raghunathan

Electrical and Computer Engineering, Purdue University, West Lafayette, IN

Published on

Cite this work

Researchers should cite this work as follows:

  • Anand Raghunathan (2012), "ECE 595Z Lecture 7: Two-level Logic Synthesis II," http://nanohub.org/resources/15048.

    BibTex | EndNote

Time

Location

EE 224, Purdue University, West Lafayette, IN

Tags

ECE 595Z Lecture 7: Two-level Logic Synthesis II
  • Lecture 7: Two-level Logic Synthesis 1. Lecture 7: Two-level Logic Syn… 0
    00:00/00:00
  • Lecture #6 Recap 2. Lecture #6 Recap 22.1
    00:00/00:00
  • Pruning Techniques: Essential Primes 3. Pruning Techniques: Essential … 247.96666666666667
    00:00/00:00
  • Pruning Techniques: Dominance 4. Pruning Techniques: Dominance 445.86666666666667
    00:00/00:00
  • Pruning Techniques: Dominance 5. Pruning Techniques: Dominance 570.16666666666663
    00:00/00:00
  • Improving the Q-M algorithm using pruning techniques 6. Improving the Q-M algorithm us… 741.73333333333335
    00:00/00:00
  • Improving the Q-M algorithm using pruning techniques 7. Improving the Q-M algorithm us… 1332.3
    00:00/00:00
  • General Principle 8. General Principle 1339.8
    00:00/00:00
  • Quine McCluskey Summary 9. Quine McCluskey Summary 1389
    00:00/00:00
  • Quine McCluskey: Remaining issues 10. Quine McCluskey: Remaining iss… 1425.3666666666666
    00:00/00:00
  • Solving the Cyclic Core 11. Solving the Cyclic Core 1500.4666666666667
    00:00/00:00
  • Petrick’s Method 12. Petrick’s Method 1538.5666666666666
    00:00/00:00
  • Petrick’s method 13. Petrick’s method 1568.7666666666667
    00:00/00:00
  • Petrick’s method 14. Petrick’s method 1877.5
    00:00/00:00
  • Petrick’s method 15. Petrick’s method 2026.5
    00:00/00:00
  • Petrick’s method 16. Petrick’s method 2206.4666666666667
    00:00/00:00
  • Column Covering as a MIN-SAT Problem 17. Column Covering as a MIN-SAT P… 2267.4333333333334
    00:00/00:00
  • Branch and Bound 18. Branch and Bound 2492.7666666666669
    00:00/00:00
  • Branch and Bound 19. Branch and Bound 2718.3
    00:00/00:00
  • Branch and Bound : Maximal Independent Set Heuristic 20. Branch and Bound : Maximal Ind… 3068.2333333333331
    00:00/00:00
  • MIS – Equivalent Graph Problem 21. MIS – Equivalent Graph Probl… 3274.4333333333334
    00:00/00:00
  • Branch and Bound : Maximal Independent Set Heuristic 22. Branch and Bound : Maximal Ind… 3482.0666666666666
    00:00/00:00
  • MIS Computation : Examples 23. MIS Computation : Examples 3787.4666666666667
    00:00/00:00
  • Putting it Together : Branch and Bound with MIS Computation 24. Putting it Together : Branch a… 3989.2333333333331
    00:00/00:00