L01-Comb1Reps handout

L01-Comb1Reps handout - LEC 1 Spring 2009 ECE 18-240...

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: LEC 1 Spring 2009 ECE 18-240 Fundamentals of Computer Engineering LEC 1: Representing Combinational Logic Don Thomas & William Nace Electrical & Computer Engineering Carnegie Mellon University Fall-09 18-240 LEC1 18-240: Where are we...? 1 Handouts: Lec1 No recitations, no labs this week. Start next week. 2 Week Date Lecture Reading Lab HW 1 8/25 L0 Introduction, Comb. Logic Chapter1 (optional) & Chapter2 (optional) No Lab 8/27 L1 Boolean Algebra Ch4.1~4.2 8/28 No Friday recitations 2 9/1 L2 Karnaugh Maps Ch4.3 Lab 0 HW1 9/3 L3 Verilog HDL and simulation Ch5.1 and Ch5.4 9/4 Recitation 3 9/8 L4 Logic Minimization (Q-M Algorithm) Ch4.3~4.4 Lab 1A 9/10 L5 Structured Logic Implementation 1A 9/11 Recitation: HW1 and Quiz 4 9/15 L6 Synthesizable Verilog Chapter 6 Lab 1B HW2 9/17 L7 Comb. Logic Wrap-up Chapter 6 1B 9/18 Recitation: Lab Quiz 5 9/22 L8 Numbers and Arithmetic Chapter 2; HW3 Out Lab 2A 9/24 L9 Flip-fops and FSMs Chapter 7.1~7.8 2A 9/25 Recitation: HW2 and Quiz Fall-09 18-240 L1 Representing Combinational Logic What you (probably) know Overview: Combinational Logic Boolean Algebra, Defining laws (Axioms), some useful manipulations Basic Gates: AND, OR, NOT, NAND, NOR, XOR, Why simplification? A little bit of motivation What you (probably) dont know Industrial-strength representation and manipulation techniques Boolean algebra beyond simple stuff Canonical forms for Boolean equations This lecture Some basic methods for representing combinational logic: Boolean algebra, canonical forms, hardware description language form 3 Fall-09 18-240 L1 Boolean Algebra: Now What? Can do simplification Given an expression, apply Boolean laws to the equation(s) until the result looks simple enough Try this one 1-bit adders carry-out function: Cout := A' B Cin + A B' Cin + A B Cin' + A B Cin Hmm, same problem as regular algebra how do you known youre done? A B Cin Cout Sum Hint X = X + X Cout := A Cin + B Cin + A B F r o m l a s t t i m e Cout := (A' B Cin + A B Cin ) + (A B' Cin + A B Cin ) + (A B Cin' + A B Cin) Cout := Cin (A' B + A B' ) + A B Cout := A' B Cin + A B' Cin + A B Cout := A' B Cin + A B' Cin + A B Cin' + A B Cin + A B Cin + A B Cin 4 Fall-09 18-240 L1 Boolean Algebra Duality Interesting observation All the axioms come in dual form Anything true for an expression also true for its dual So any derivation you could make that is true, can be flipped into dual form, and it stays true. Duality More formally A dual of a Boolean expression is derived by replacing Every AND operation by an OR operation Every OR operation by an AND Every constant 1 with a constant 0 Every constant 0 with a constant 1 But dont change any of the literals, or play with the complements!...
View Full Document

This note was uploaded on 05/10/2011 for the course ECE 18240 taught by Professor Hoe during the Fall '08 term at Carnegie Mellon.

Page1 / 18

L01-Comb1Reps handout - LEC 1 Spring 2009 ECE 18-240...

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