This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: • Could result in huge worstcase path. • Very complex. • Probably would want to minimize # gate inputs anyways… Let’s aim lower • Restrict ourselves to 2level logic – Sumofproducts for now, we’ll do productofsums later. – Minimize the number of gates • and number of inputs it turns out Motivational examples #1 • =ab’c + abc + abc’ #2 • =a’b’c + a’cd’+bcd ab/c 00 01 11 10 1 ab/c 00 01 11 10 1 ab/c 00 01 11 10 1 ab/c 00 01 11 10 1 ab/c d 00 01 11 10 00 01 11 10...
View
Full Document
 Spring '11
 david
 #, 4bit, Canonical form, gate delays, 256bits

Click to edit the document details