ECE 595Z Lecture 20: Multi-level Synthesis VII

Published on

Cite this work

Researchers should cite this work as follows:

  • Anand Raghunathan (2012), "ECE 595Z Lecture 20: Multi-level Synthesis VII," https://nanohub.org/resources/15452.

    BibTex | EndNote

Time

Location

EE 224, Purdue University, West Lafayette, IN

Tags

ECE 595Z Lecture 20: Multi-level Synthesis VII
  • ECE 595Z Digital VLSI Design Automation Module 5 (Lectures 14-20): Multi-level Synthesis Lecture 20 1. ECE 595Z Digital VLSI Design A… 0
    00:00/00:00
  • Lecture #19: Re-cap 2. Lecture #19: Re-cap 41.808475141808479
    00:00/00:00
  • Technology Mapping Using Graph Covering 3. Technology Mapping Using Graph… 79.813146479813156
    00:00/00:00
  • Background: Unate and Binate Covering Problems 4. Background: Unate and Binate C… 205.37203870537203
    00:00/00:00
  • Background: Binate Covering Problems 5. Background: Binate Covering Pr… 401.40140140140142
    00:00/00:00
  • Technology Mapping as Binate Covering 6. Technology Mapping as Binate C… 617.917917917918
    00:00/00:00
  • Technology Mapping as Binate Covering 7. Technology Mapping as Binate C… 814.21421421421428
    00:00/00:00
  • Technology Mapping as Binate Covering 8. Technology Mapping as Binate C… 1029.2959626292959
    00:00/00:00
  • Technology Mapping as Binate Covering 9. Technology Mapping as Binate C… 1108.3750417083752
    00:00/00:00
  • Example 10. Example 1360.9275942609277
    00:00/00:00
  • Example 11. Example 1653.6870203536871
    00:00/00:00
  • Problems with Binate Covering Formulation of Technology Mapping 12. Problems with Binate Covering … 1747.5141808475144
    00:00/00:00
  • DAG Covering Using Tree Covering 13. DAG Covering Using Tree Coveri… 1946.0460460460461
    00:00/00:00
  • Dynamic Programming 14. Dynamic Programming 2079.2792792792793
    00:00/00:00
  • Dynamic Programming – Simple Example 15. Dynamic Programming – Simple… 2310.9776443109777
    00:00/00:00
  • Tree Covering Using Dynamic Programming 16. Tree Covering Using Dynamic Pr… 2518.7187187187187
    00:00/00:00
  • Tree Covering Using Dynamic Programming 17. Tree Covering Using Dynamic Pr… 2639.2726059392726
    00:00/00:00
  • Tree Covering Using Dynamic Programming 18. Tree Covering Using Dynamic Pr… 2771.1044377711046
    00:00/00:00
  • Tree Covering Using Dynamic Programming 19. Tree Covering Using Dynamic Pr… 2911.1778445111781
    00:00/00:00
  • Tree Covering Using Dynamic Programming 20. Tree Covering Using Dynamic Pr… 2975.7757757757759
    00:00/00:00
  • Tree Covering in Action 21. Tree Covering in Action 3103.7370704037371
    00:00/00:00
  • Complexity of Tree Covering 22. Complexity of Tree Covering 3605.4387721054391
    00:00/00:00
  • OK, so that’s the basic idea.. 23. OK, so that’s the basic idea… 3701.7684351017688
    00:00/00:00
  • Inverter Heuristic 24. Inverter Heuristic 3744.8782115448785
    00:00/00:00
  • Inverter Heuristic 25. Inverter Heuristic 3955.5555555555557
    00:00/00:00
  • Inverter Heuristic 26. Inverter Heuristic 4047.681014347681
    00:00/00:00
  • Inverter Heuristic 27. Inverter Heuristic 4131.2645979312647
    00:00/00:00