2_Cost_Functions_Slides

2_Cost_Functions_Slides - ECE ECE 3504 Digital Design I...

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: ECE ECE 3504 Digital Design I Section 2: Cost Functions and Optimization What What You Should Already Already Know! The basic principles of Karnaugh mapping The general organization of twolevel sum-of-products (SOP) and product-of-sums circuits Classical Classical Cost Let G equal the total number of gates in a two-level circuit. Let I equal the total number of inputs on all of the gates in the circuit. Assumptions The inverted versions of variables are available. Gates having any number of inputs are are readily available. Calculating Calculating Classical Cost Cost f(A,B,C,D) = AC′ + A′BD + B′C′D′ + B′CD Minimizing Minimizing Classical Cost Cost Techniques such as Karnaugh mapping and the Quine-McCluskey Algorithm find the two-level SOP or POS implementations having the minimum classical cost. What does Karnaugh mapping do that achieves this? ...
View Full Document

Ask a homework question - tutors are online