{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw2prob - largest number of memory chips that can be...

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

View Full Document Right Arrow Icon
ELEC 7770-001, Spring 2010 Homework # 2 Problems Assigned: Wednesday, March 1, 2010 Due: Wednesday, March 15, 2010 Problem 1: Using the Elmore delay formula, show that the delay of a long interconnect of length s is proportional to s 2 . Problem 2: A long interconnect has a delay D. To reduce the delay, the interconnect is split into n equal length segments. The segments are joined by n – 1 buffers, each having a delay 0.1D. Find the value of n that will minimize the buffered interconnect delay. What is the percentage reduction in delay? Problem 3: The following data is available for a foundry that manufactures VLSI chips: Type of chips Profit per chip Chips/wafer Test time/chip Memory $0.75 1,000 30s Processor $1.00 750 10s The foundry fabricates 100 wafers per day and has 400 hours of tester time available each day. What is the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: largest number of memory chips that can be manufactured per day without lowering the profit? What is then the number of processor chips manufactured per day? What are the minimum dollar revenues earned per wafer and per hour of tester time by selling those resources such that it would be no longer profitable to manufacture processor and memory chips? Problem 4: Develop a linear programming model to determine the critical path delay of a combinational logic block. Problem 5: Find the minimal sum of products for the four-variable Boolean function {0, 2, 4, 5, 6, 7, 9, 10, 11, 13}. ELEC7770 Homework 2 Problems Page 1 of 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online