This preview shows page 1. Sign up to view the full content.
Unformatted text preview: erms of library gates  List three steps done in dynamic programming  Find minimum‐cost matched pattern at a node in the subject graph  Write recursive formula describing the minimum cost when cost is area or delay  Given a subject graph, apply the tech mapping algorithm to optimize a given cost function  Write recursive formula describing the best cost for a newly given cost function  Show all steps for a complete solution to a given tech mapping problem  Know (w/o proof)...
View Full Document
This document was uploaded on 02/23/2014 for the course ELECTRICAL 556 at University of Texas at Austin.
- Spring '14
- Electrical Engineering