ECE 171 Digital Circuits Chapter 6 Logic Circuits

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Chapter 3 Logic Gates and Boolean Algebra – Part 1
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Documentation Standards
MULTI-LEVEL GATE NETWORKS
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Digital Design.
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
ECE 171 Digital Circuits Chapter 6 Logic Circuits Herbert G. Mayer, PSU Status 1/16/2016 Copied with Permission from prof. Mark PSU ECE.
ECE 171 Digital Circuits Chapter 4 Boolean Algebra Herbert G. Mayer, PSU Status 2/1/2016 Copied with Permission from prof. Mark PSU ECE.
Logic gates.
Lecture 4 Topics Boolean Algebra Huntington’s Postulates Truth Tables
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Truth Table to Statement Form
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Logic Gates and Boolean Algebra
Chapter 2: Boolean Algebra and Logic Functions
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Unit 2 Boolean Algebra.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Lecture 6 Topics Combinational Logic Circuits
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
Introduction to Logic Gates
Logic Gates.
EI205 Lecture 5 Dianguang Ma Fall 2008.
Boolean Algebra and Combinational Logic
Boolean Expressions Lecture No. 10.
KS4 Electricity – Electronic systems
Lecture 6 Topics Combinational Logic Circuits
KS4 Electricity – Electronic systems
ECE 331 – Digital System Design
CHAPTER 2 Boolean Algebra
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Boolean Algebra Why study Boolean Algebra?
Bushnell: Digital Systems Design Lecture 4
UNIVERSAL GATES.
Basic Logic Gates 1.
Schematics 201 Lecture Topic: Electrical Symbols
BASIC & COMBINATIONAL LOGIC CIRCUIT
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Lecture 4 Topics Boolean Algebra Huntington’s Postulates Truth Tables
JC Technology Logic Gates.
Logic Gates.
Copied with Permission from prof. Mark PSU ECE
KS4 Electricity – Electronic systems
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Lecture 5 Logistics Last lecture Today’s lecture
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Combinational Logic Circuit
Presentation transcript:

ECE 171 Digital Circuits Chapter 6 Logic Circuits Herbert G. Mayer, PSU Status 4/1/2018 Copied with Permission from prof. Mark Faust @ PSU ECE

Syllabus Combinational Circuits Graphic Symbols (IEEE and IEC) Switching Circuits Analyzing IC Logic Circuits Designing IC Logic Circuits Detailed Schematic Diagrams Using Equivalent Symbols

Combinational Logic Circuits Outputs depend only upon the current inputs (not on previous “state”) Positive Logic High voltage (H) represents logic “True” “Signal BusGrant is asserted High” Negative Logic Low voltage (L) represents logic “True” “Signal BusRequest# is asserted Low”

IEEE: Institute of Electrical and Electronics Engineers IEC: International Electro- technical Commission

n.o. = normally open n.c. = normally closed These regenerative logic switching circuits that we’ll be seeing are actually very close to the way real CMOS ICs are implemented and can be a useful model for us without getting into the details of how the transistors actually work. In particular, note the voltage differential and direction of current flow!

Truth Tables Question: How many rows are there in a truth table for n boolean variables? 2n 1 2 3 . 63 26 = 64 B5 B4 B3 B2 B1 B0 F 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 1 1 0 . 1 1 1 1 1 1 1 As many rows as unique combinations of inputs Enumerate by counting in binary

Analyzing Logic Circuits Reference Designators (“Instances”) X X + Y (X + Y)×(X + Z) X + Z

Analyzing Logic Circuits A×B A×B + B×C C B×C

Designing Logic Circuits F1 = A×B×C + B×C + A×B SOP form with 3 terms  3 input OR gate

Designing Logic Circuits Complement already available F1 = A×B×C + B×C + A×B

Signal line – any ‘wire’ to a gate input or output Some Terminology F1 = A×B×C + B×C + A×B Signal line – any ‘wire’ to a gate input or output

Net – collection of signal lines which are connected Some Terminology F1 = A×B×C + B×C + A×B Net – collection of signal lines which are connected

Fan-out – Number of other inputs an IC output is driving Some Terminology F1 = A×B×C + B×C + A×B Fan-out – Number of other inputs an IC output is driving Fan-out of 2 Book confused “fan-out” with “maximum fan-out”

Fan-in – Number of inputs to a gate Some Terminology F1 = A×B×C + B×C + A×B Fan-in – Number of inputs to a gate Fan-in of 3 Book confused “fan-out” with “maximum fan-out”

Vertical Layout – SOP Form

Vertical Layout – SOP Form

>2 Input OR Gates Not Available for all IC Technologies Solution: “Cascading” gates

Vertical Layout – POS Form F2 = ?? Do in class now

Vertical Layout – POS Form F2 = (X+Y)×(X+Y)×(X+Z)

Using DeMorgan Equivalents Often prefer NAND/NOR to AND/OR when using real ICs NAND/NOR typically have more fan-in NAND/NOR “functionally complete” NAND/NOR usually faster than AND/OR

AND/OR Forms of NAND DeMorgan’s Theorem

Summary of AND/OR Forms Change OR to AND “Complement” bubbles

Equivalent Signal Lines

NAND/NAND Example

NOR/NOR Example