Digital circuits make up all computers and computer systems. The operation of digital circuits is based on



Similar documents
1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

ENGI 241 Experiment 5 Basic Logic Gates

Boolean Algebra Part 1

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

Figure 8-1 Four Possible Results of Adding Two Bits

Gates, Circuits, and Boolean Algebra

Simplifying Logic Circuits with Karnaugh Maps

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

Decimal Number (base 10) Binary Number (base 2)

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

BOOLEAN ALGEBRA & LOGIC GATES

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

CHAPTER 3 Boolean Algebra and Digital Logic

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Chapter 2 Logic Gates and Introduction to Computer Architecture

Machine Architecture and Number Systems. Major Computer Components. Schematic Diagram of a Computer. The CPU. The Bus. Main Memory.

Objectives: Part 1: Build a simple power supply. CS99S Laboratory 1

Cornerstone Electronics Technology and Robotics I Week 15 Voltage Comparators Tutorial

Digital Logic Elements, Clock, and Memory Elements

DEPARTMENT OF INFORMATION TECHNLOGY

CHAPTER 11: Flip Flops

Unit 3 Boolean Algebra (Continued)

CH3 Boolean Algebra (cont d)

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas

Logic in Computer Science: Logic Gates

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Combinational Logic Design

Counters and Decoders

Table 1 Comparison of DC, Uni-Polar and Bi-polar Stepper Motors

Diodes have an arrow showing the direction of the flow.

EE360: Digital Design I Course Syllabus

Two-level logic using NAND gates

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

Binary Adders: Half Adders and Full Adders

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

1.1 The 7493 consists of 4 flip-flops with J-K inputs unconnected. In a TTL chip, unconnected inputs

3.Basic Gate Combinations

Programming A PLC. Standard Instructions

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

COMBINATIONAL CIRCUITS

Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course

The components. E3: Digital electronics. Goals:

Digital Electronics Detailed Outline

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

Elementary Logic Gates

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

CSE140: Components and Design Techniques for Digital Systems

ARRL Morse Code Oscillator, How It Works By: Mark Spencer, WA8SME

CSE140: Midterm 1 Solution and Rubric

Understanding Logic Design

OPERATIONAL AMPLIFIER

AUTOMATIC NIGHT LAMP WITH MORNING ALARM USING MICROPROCESSOR

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

EE 209 Lab 1 Sound the Alarm

Study Guide for the Electronics Technician Pre-Employment Examination

Switch board datasheet EB

Chapter 1. Computation theory

Chapter 3 Digital Basics

6. BOOLEAN LOGIC DESIGN

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

PROGRAMMABLE LOGIC CONTROLLERS Unit code: A/601/1625 QCF level: 4 Credit value: 15 TUTORIAL OUTCOME 2 Part 1

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

Programmable Logic Controller PLC

Apprentice Telecommunications Technician Test (CTT) Study Guide

Lecture 5: Gate Logic Logic Optimization

INTRODUCTION TO DIGITAL SYSTEMS. IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE

Karnaugh Maps (K-map) Alternate representation of a truth table

Introduction to Digital Logic with Laboratory Exercises

Lab 1: Full Adder 0.0

Analog & Digital Electronics Course No: PH-218

Digital Fundamentals. Lab 8 Asynchronous Counter Applications

Capacitive Touch Sensor Project:

LAB 7 MOSFET CHARACTERISTICS AND APPLICATIONS

Upon completion of unit 1.1, students will be able to

2) What is the structure of an organization? Explain how IT support at different organizational levels.

Gray Code Generator and Decoder by Carsten Kristiansen Napier University. November 2004

Logic gates. Chapter. 9.1 Logic gates. MIL symbols. Learning Summary. In this chapter you will learn about: Logic gates

Multiplexers and demultiplexers

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa

Chapter 9 Latches, Flip-Flops, and Timers

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.

Logic Reference Guide

Unit/Standard Number. High School Graduation Years 2010, 2011 and 2012

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Lecture-3 MEMORY: Development of Memory:

EGR 278 Digital Logic Lab File: N278L3A Lab # 3 Open-Collector and Driver Gates

OHM S LAW AND RESISTANCE

BINARY CODED DECIMAL: B.C.D.

Click on the links below to jump directly to the relevant section

Building the AMP Amplifier

Combinational circuits

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Fundamentals of Digital Electronics

RAM & ROM Based Digital Design. ECE 152A Winter 2012

Robot Board Sub-System Testing. Abstract. Introduction and Theory. Equipment. Procedures. EE 101 Spring 2006 Date: Lab Section # Lab #6

Transcription:

Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is very simple, having only three basic functions, AND, OR, and NOT. These basic functions can be combined in many ways to provide all the functions required in the central processor of a digital computer. Digital circuits operate by performing Boolean operations on binary numbers (more about binary numbers in EE 23). EE 22 Lab Briefing #3 N. B. Dodge /2

First Boolean Function: NOT NOT is the simplest logical function: input and output. NOT is defined as follows: The output f of NOT, given an input a, is the complement or opposite of the input. Or : a is the complement or opposite of the input Or : f a Since NOT can have only a or input, the output of NOT is the reverse, or complement, of the input. If the input of NOT is, the output tis. If the input of NOT is, the output is. The NOT function is called inversion, and the digital circuit which i t i i t Th l t i i it b l f NOT i inverts is an inverter. The electronic circuit symbol for NOT is: a a 2 EE 22 Lab Briefing #3 N. B. Dodge /2

The Truth Table 3 The inverter input/output relationship, with one input and output, is easy to show. For complex functions, an I/O table is helpful. We call llthis a truth th table, since it indicates the ( true ) outputs, although it normally shows outputs for all input combinations. We will demonstrate some Boolean functions using truth tables. EE 22 Lab Briefing #3 Boolean Function Truth Table Input x Input y Output f Note: This 2-input truth table shows the output f for all possible combinations of the binary inputs x and y. N. B. Dodge /2

Second Boolean Function: AND AND has two or more inputs. The truth table for a two-input AND with inputs a and b is shown in the chart. AND is defined as follows: a AND b = if and only if (iff) a = and b =. Mathematically, we represent a AND b as a b (an unfortunate choice). AND may have more than two inputs, i. e: e.: a AND b AND c AND d. The electronic circuit symbols for 2- and 4-input ANDs are shown at the right. Regardless of the number of inputs, the output of AND is iff all inputs are. 2-Input AND 4-Input AND AND Truth Table a b a AND b a b a b c d a b a b c d 4 EE 22 Lab Briefing #3 N. B. Dodge /2

Third Boolean Function: OR OR has two or more inputs. The OR truth table for two inputs a, b is shown in the adjacent chart. OR is defined as follows: a OR b = if either a or b or both a and b =. Mathematically, we represent a OR b as a + b (another bad choice). OR may have more than two inputs, i. e.: a OR b OR c OR d. The electronic circuit symbols for 2- and 4- input ORs are shown at the right. Regardless of the number of inputs, the output of OR is iff all inputs are. OR Truth Table a b a OR b 2-Input OR a b 4-Input OR a b c d a+b a+b+c+d 5 EE 22 Lab Briefing #3 N. B. Dodge /2

Logic and Electronic circuits don t manipulate logic and literally. In digital circuits, the values and are levels of voltage, and the logic circuits that we use are technically inverting amplifiers with saturated outputs. In the circuits we will use, logic is volts, and logic is 5 volts. Logic / Logic / inputs outputs (V, 5 V) (V, 5 V) 6 EE 22 Lab Briefing #3 N. B. Dodge /2

Making More Complex Boolean Functions The three Boolean functions discussed above can be used to form more complex functions. ANY computer function can be performed using combinations of AND, OR, and NOT. To simplify the definition of combinational logic (the logic of the computer CPU), any logic function can be composed of a level of AND gates followed by a single OR gate. There are a few other ways to form Boolean circuits, but we will cover only this one method in Lab 3. 7 EE 22 Lab Briefing #3 N. B. Dodge /2

Uniqueness of AND The uniqueness of the AND function is that the output of AND is except when EVERY input =. In the 4 gates to the right, a SINGLE input into each gate forces the output to. The output of AND is only when ALL inputs = (8- input gate to right). 8 EE 22 Lab Briefing #3 N. B. Dodge /2

The Any Quality of OR The output of OR = if ANY input =. OR outputs a iff ALL inputs =. We can use the ability of OR to pass any and the unique - outputs of the AND to create Boolean functions. 9 EE 22 Lab Briefing #3 N. B. Dodge /2

Digital Design In circuit design, inputs and outputs are defined by a spec. Since computer circuits use only binary numbers, inputs are always and, and the output is always and. The engineer designs the circuit between input and output by: Making a truth table to represent the input/output p relationship. Defining a Boolean expression that satisfies the truth table. Constructing a circuit that represents the Boolean function. Establish inputs and outputs Construct Truth Table Define Boolean expression in SOP or POS form Design digital circuit based on Boolean expression EE 22 Lab Briefing #3 N. B. Dodge /2

Creating a Computer ( Boolean ) Function A spec for a function f of two variables x and y is that f = when x and y are different, and otherwise. The truth table charts f per the spec. How can we describe this behavior with a Boolean expression? For the first, we can create an AND function: x y. Note that this expression is ONLY when x =, y =. For the second, we create x y, which is only for x =, y =. EE 22 Lab Briefing #3 x y f x y x y N. B. Dodge /2

Boolean Function (2) 2 First AND function: x y. Second AND function: x y. The two Boolean AND functions each describe one of the two conditions in which f is. How do we create a Boolean function that describes BOTH conditions of f =? Recall that any is passed through OR. Then if we send both ones through a single OR, its output will match the specified performance of f. EE 22 Lab Briefing #3 x y f x y x y N. B. Dodge /2

Boolean Function (3) We OR the two AND functions: x y f f x y x y We now have a complete description (Boolean expression) for the function f. Since we know what AND and OR circuits look like, we can build a digital circuit that produces f. x y f x y x y 3 EE 22 Lab Briefing #3 N. B. Dodge /2

Building Boolean Functions As we have just seen, if we have Boolean functions that result from a truth table and spec, we can convert the Boolean functions to computer circuits. Consider these functions: a b c f a b f ( a b) c f : 2: 3: 4 EE 22 Lab Briefing #3 N. B. Dodge /2

Quick Exercise Designing a circuit from the Boolean expressions: ( ab ) ( cd ) f a b c d f 5 EE 22 Lab Briefing #3 N. B. Dodge /2

Design: Spec to Truth Table to Circuit Say you have the following design spec for function f: There are three inputs x, y, and z, to a digital circuit. The circuits must have an output of when y = z = and x = ; and when x = z = and y =. Design the circuit using AND, OR, and NOT gates. x y z f(x, y, z) AND s f xyz f x yz The truth table above shows the desired output: f = when x=, y, z =, f = wheny= y, x, z =. 6 EE 22 Lab Briefing #3 N. B. Dodge /2

7 Getting the Boolean Function We can create a Boolean function for each of the two conditions: Inverting x and ANDing it with y and z creates a for the first condition. Inverting gy and ANDing it with x and z creates the other. Notice that each AND function produces a ONLY for that combination of variables. According to the definition of OR, any goes through that gate. Therefore OR the two AND functions together to get a function that is for both cases! EE 22 Lab Briefing #3 x y z f(x, y, z) AND s f f This is a ONLY for (,,) xyz x yz This is a ONLY for (,,) N. B. Dodge /2

Boolean Function and Circuit x y z x y z x y z f(x, y, z) AND s x y z x y z 8 The OR function (f) completely satisfies the spec and truth table! EE 22 Lab Briefing #3 N. B. Dodge /2

Key parts: LED indicators Circuit board +5V power Lab Instrument: IDL-8 Momentary - switches - input switches 9 EE 22 Lab Briefing #3 N. B. Dodge /2

Digital Circuit Kit 2 The digital circuit kits are also used in EE 23. You will only be using AND, OR, and NOT circuits (see below). NEVER replace a bad or broken circuit in the kit. Give to the TA to be replaced. ALWAYS put up the kit when you are done. EE 22 Lab Briefing #3 N. B. Dodge /2

Plugging in a Digital IC and Wiring Up a Circuit Remember: The circuit is ALWAYS plugged in so that it spans a channel in the circuit board. Therefore a wire plugged into any of the parallel holes into which a chip leg is plugged is connected to that leg of the chip. 2 EE 22 Lab Briefing #3 N. B. Dodge /2

Circular dot Ground (V.) connection Digital IC Circuit Diagrams Notch 4 2 3 Power (+5V.) 3 2 connection 4 5 6 9 7 8 74 LS XXX Chip Outline 3 9 5 3 4 2 8 6 4 2 SN 74LS4 Hex inverter gate 2 4 5 9 2 3 8 3 6 8 SN 74LS8 Quad 2 input AND gate 2 4 5 9 2 3 32 3 6 8 SN 74LS32 Quad 2 input OR gate 22 You will be using the 74LS4, 74LS8, and 74LS32 digital integrated circuits. The diagram above (also in your manual) shows the outline of the chip, with power/ground inputs. The three chip schematics show how the circuits in each chip connect to the input pins. EE 22 Lab Briefing #3 N. B. Dodge /2