Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: erms of library gates [3] List three steps done in dynamic programming [1] Find minimum‐cost matched pattern at a node in the subject graph [3] Write recursive formula describing the minimum cost when cost is area or delay [1] Given a subject graph, apply the tech mapping algorithm to optimize a given cost function [4] Write recursive formula describing the best cost for a newly given cost function [1] Show all steps for a complete solution to a given tech mapping problem [2] 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.

Ask a homework question - tutors are online