Lecture6 - ENSC150 (Fall 200 6 ) Lecture 6 Agenda...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: ENSC150 (Fall 200 6 ) Lecture 6 Agenda Optimization Karnaugh Map 1/7 Lecture 6 Atousa Hajshirmohammadi, SFU Design Procedure Specification: Specify what you want your circuit to do. Formulation: Drive the input-output relationship, i.e., Truth table, Boolean equation, or both Optimization: Try to optimize your function so that the cost of building the digital circuit is reduced (ideally minimized). e.g., reducing the number of required gates is one way to reduce the cost of implementation. Technology Mapping: Transform your optimized Boolean equation using the gates that are available to you. Verification: Verify that your final circuit works! 2/7 Lecture 6 Atousa Hajshirmohammadi, SFU Optimization Optimization is simplifying a Boolean expression based on a specified cost criteria. A usual Cost criteria is called the Gate Input Cost, which is the sum of Number of all literals Number of all terms, except those with a single literal (optional) number of distinct complemented literals...
View Full Document

Page1 / 7

Lecture6 - ENSC150 (Fall 200 6 ) Lecture 6 Agenda...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online