02-gates-w-g

# Usealgebraidentitiesortruth tablestoshowequivalence

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b d a b d 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 out Build truth table Minimize diagram Derive logic diagram Binary (two symbols: true and false) is the basis of Logic Design More than one Logic Circuit can implement same Logic function. Use Algebra (Identities) or Truth Tables to show equivalence. Any logic function can be implemented as “sum of products”. Karnaugh Maps minimize number of gates. From Transistors to Gates to Logic Circuits Logic Gates • From transistors • Truth Tables Logic Circuits • Identity Laws • From Truth Tables to Circuits (Sum of Products) Logic Circuit Minimization • Algebraic Manipulations • Truth Tables (Karnaugh Maps) Transistors (electronic switch) Transistors: • 6:10 minutes (watch from from 41s to 7:00) • http://www.youtube.com/watch?v=QO5FgM7MLGg • Fill our Transistor Worksheet with info from Video • NMOS Transistor PMOS Transistor VS VD VG VG = VS VG = 0 V VS = 0 V • Connect source to drain when gate = 1 • N-channel VG VG = VS VG = 0 V VD = 0 V Connect source to drain when gate = 0 P‐channel • NMOS Transistor PMOS Transistor VS VD VG VG = 1 VG = 0 VS = 0 V • Connect source to drain when gate = 1 • N-channel VG VG = 1 VG = 0 VD = 0 V Connect source to drain when gate = 0 P‐channel Vsupply (aka logic 1) in out • Function: NOT • Called an inverter • Symbol: in out (ground is logic 0) In 0 1 Out 1 0 Truth table • Useful for taking the inve...
View Full Document

## This document was uploaded on 02/22/2014 for the course CS 3410 at Cornell.

Ask a homework question - tutors are online