# 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor

Save this PDF as:

Size: px
Start display at page:

Download "1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor"

## Transcription

1 Chapter 1.10 Logic Gates 1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor Microprocessors are the central hardware that runs computers. There are several components that make a processor. The first is the transistor. Next, are logic gates where you put more than one transistor to work with others. The transistor is fundamental because it carries an electrical charge and can direct the current flow through the logic gates. The microprocessor works with binary arithmetic by using binary math to perform operations. When a microprocessor is designed, along with other design focus areas "Logic gate cell library (a library is collection of all low level logic functions like AND, OR and NOT etc.), which is used to implement the logic" is also deeply planned and developed. By themselves, transistors are not very functional. However, if you combine them with other transistors, you get logic gates. Logic gates carry out the instructions mathematical or otherwise that a processor performs, for example a logic gate performs a logical operation on one or more logic inputs and produces a single logic output. When you connect a variety of logic gates together, the results are interesting circuits. The logic is called Boolean logic and is most commonly found in digital circuits. As mentioned logic gates are primarily implemented electronically using transistors in microprocessors, but for other devices can also be constructed using electromagnetic relays (relay logic), fluidic logic, pneumatic logic, optics, molecules, or even mechanical elements. Following three logic gates are part of our syllabus. 1. AND gate, 2. OR gate, and 3. NOT gate. AND gate: AND gate symbol The AND gate is a digital logic gate that implements logical conjunction - it behaves according to the table on your right. A HIGH output (1) results only if both the inputs to the AND gate are HIGH (1). If neither or only one input to the AND gate is HIGH, a LOW output results. In another sense, the function of AND effectively finds the minimum between two binary digits. INPUT OUTPUT A B A AND B (Q)

2 OR Gate: OR gate symbol The OR gate is a digital logic gate that implements logical disjunction - it behaves according to the table on your right. A HIGH output (1) results if one or both the inputs to the gate are HIGH (1). If neither input is HIGH, a LOW output (0) results. In another sense, the function of OR effectively finds the maximum between two binary digits. NPUT A B OUTPUT A + B (Q) NOT gate (Inverter): NOT gate symbol In digital logic, an inverter or NOT gate is a logic gate which implements logical negation. Not gate represents perfect switching behavior. NPUT A OUTPUT NOT A

3 1.10 (b) Calculate outcome from a set of logic gates given input In this part 1.10 (b) we will explore the application of Boolean algebra in the design of electronic circuits. The basic elements of circuits are gates. Each type of gate implements a Boolean operation. We will study combinational circuits, which means the circuits whose output depends only on the input and not on any memory. Consider Boolean expression ; i.e., is the complement of. Now and. This Boolean operation, i.e., compliment can be implemented using a device called NOT gate or the Inverter. It can be expressed as below: NOT gate (INVERTER) Now consider Boolean expression ; i.e., a is the Boolean product of &. As we know that,, and. This Boolean operation, i.e., product can be implemented using a device called AND gate. It can be expressed as below: AND gate Next consider Boolean expression ; i.e., a is the Boolean sum of &. As we know that and. This Boolean operation, i.e., sum can be implemented using a device called OR gate. It can be expressed as below: OR gate In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called combinatorial circuits. The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The circuits for expressions x y and xy are shown below in figures (a) and (b), respectively:

4 The circuits for expressions x +y and x+y are shown below in figures (a) and (b), respectively: The circuit for x y and x +y are shown below in figures (a) and (b), respectively: (a) (b) Let a be a Boolean expression, then its circuit diagram is defined as follows: 1. If a is x, then it circuit diagram is given by a NOT gate, 2. If a is x+y, then it circuit diagram is given by a OR gate, 3. If a is xy, then it circuit diagram is given by a AND gate, 4. If a is B, then it circuit diagram is shown below, 5. If a is Bx, then it circuit diagram is shown below, 6. If a is B+x, then it circuit diagram is shown below, 7. If a is By, then it circuit diagram is shown below, 8. If a is B+y, then it circuit diagram is shown below,

5 9. If a is xy +x y, then it circuit diagram is shown below, We now break xy and x y and include their own circuits in diagram above and create a new circuit with four gates. In order to simplify the circuit above we can split x and y inputs half way and use it for two or more gates. So the above diagram can be simplified and presented as: Truth Table: A truth table is a mathematical table used in logic specifically in connection with Boolean algebra and Boolean functions to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables. In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, logically valid. Practically, a truth table is composed of one column for each input variable (for example, A and B), and one final column for all of the possible results of the logical operation that the table is meant to represent (for example, A OR B). Each row of the truth table therefore contains one possible configuration of the input variables (for instance, A=true B=false), and the result of the operation for those values. Number of possible rows in a truth table is directly dependant on the number of inputs and can be easily find out by applying 2 n, where n is the number of inputs mentioned in truth table.

6 Here is a truth table giving definitions of the most commonly used 3 out of the 16 possible truth functions of 2 binary inputs (P,Q are thus boolean variables): P Q P AND Q P OR Q NOT P NOT Q T T T T F F T F F T F T F T F T T F F F F F T T Note that total number of rows is, 2 2 = 4. Applications of truth tables: In computer science, truth tables can be used to reduce basic Boolean operations to simple correlations of inputs to outputs, without the use of logic gates or code. For example, a binary addition can be represented with the truth table: A B C R where A = First Operand B = Second Operand C = Carry R = Result This truth table is read left to right: Value pair (A,B) equals value pair (C,R). Or for this example, A plus B equal result R, with the Carry C. Note that this table does not describe the logic operations necessary to implement this operation; rather it simply specifies the function of inputs to output values.

7 In this case it can only be used for very simple inputs and outputs, such as 1's and 0's, however if the number inputs increases, the size of the truth table will increase. For instance, in an addition operation, one needs two operands, A and B. Each can have one of two values, zero or one. The number of combinations of these two values is 2x2, or four. So the result is four possible outputs of C and R. The first "addition" example above is called a half-adder. A full-adder (not part of 2010 computing syllabus) is when the carry from the previous operation is provided as input to the next adder. Thus, a truth table of eight rows would be needed to describe a full adder's logic: A B C* C R Same as previous, but C* = Carry from previous adder The next level after logic gates in microprocessor gets even more complicated. First, we combined transistors together to make logic gates. Now, in combining a whole lot of logic gates together in clever ways, we can make complex circuits that do things like adding two numbers together, multiplying two numbers together, moving data from one place to another, and so on. Adders: In electronics, an adder or summer is a digital circuit that performs addition of numbers. In modern computers adders reside in the arithmetic logic unit (ALU) where other operations are performed. The most common adders operate on binary numbers. There are two types of adders 1. Half adder, which adds only two values and 2. Full adder (Not part of this syllabus), which adds more than two values.

8 Half adder: A half adder is a logical circuit that performs an addition operation on two one-bit binary numbers often written as A and B. The half adder output is a sum of the two inputs usually represented with the signals and S where. Following is the logic table for a half adder: Inputs Outputs A B C S As an example, a Half Adder can be built with an OR gate, two AND gates and one Inverter. Other forms of half adder using OR, AND and Not gates could be: Can you device Boolean equations for all above four circuits?

9 1.10(c) Logic gates as a form of refreshable memory and as an accumulator. In a computer's central processing unit (CPU), an accumulator is a register in which intermediate arithmetic and logic results are stored. Without a register like an accumulator, it would be necessary to write the result of each calculation (addition, multiplication, etc.) to main memory, perhaps only to be read right back again for use in the next operation. Access to main memory is slower than access to a register like the accumulator because the technology used for the large main memory is slower (but cheaper) than that used for a register. The example for accumulator use is summing a list of numbers. The accumulator is initially set to zero, and then each number in turn is added to the value in the accumulator. Only when all numbers have been added is the result held in the accumulator written to main memory An accumulator is build with an adder whose sum can be loaded into a register as shown in figure below. Both adder and register in an accumulator are made up of logic gate circuits. Accumulators are a basic building block of most large digital logic projects. As an analogy, you can think of an up accumulator as a file cabinet. It starts out empty. If you add two, it now holds the value of two. If you add three more it now holds five. Ad der R e gi st er One of the more interesting things that you can do with Boolean gates is to create memory with them. If you arrange the gates correctly, they will remember an input value. This simple concept is the basis of RAM (random access memory) in computers, and also makes it possible to create a wide variety of other useful circuits like CMOS (BIOS). Memory relies on a concept called feedback. That is, the output of a gate is fed back into the input. The simplest possible feedback circuits using two inverters are shown below: If you follow the feedback path, you can see that if output happens to be 1, it will always be 1. If it happens to be 0, it will always be 0. Since it's nice to be able to control the circuits we create, this one does let us see how feedback works. It turns out that in "real" circuits, you can actually use this sort of simple inverter feedback approach to hold bits as long as required.

10 This type of circuit is commonly known as Flip-Flop circuits. A flip-flop holds a single bit of memory. In reality, flip-flops are a bit more complicated and have 5 (or so) logic gates (transistors) per flip-flop. Transistors are all enclosed in an IC, or integrated circuit. Consider a 1 GB memory chip (DIMM), which is 1 GB = 8,589,934,592 bits of memory. That s about 43 million transistors. In reality, those transistors are split into 9 ICs of about 5 million transistors each. The Intel Pentium IV processors have 55 million transistors.

11 Example Questions: 1. Draw a circuit diagram for = (xy' + x'y)z 2. Device a suitable Boolean expression for the circuit below: 3. Determine what the following logic circuit does Hint: Construct a truth table with 8 rows (2 3 ), 3 "input" columns (A, B, C) and 5 "output" columns (D, E, F, G, H) Determine the "outputs" D, E, F, G, H one at a time and in that order. 4. Create a truth table for an OR gate with two inputs A and B. 5. (i) Copy and complete this table for the circuit. (ii) Give a possible use for this circuit in a processor, explaining your answer.

### Gates, Circuits, and Boolean Algebra

Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks

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

File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

### Chapter 4. Gates and Circuits. Chapter Goals. Chapter Goals. Computers and Electricity. Computers and Electricity. Gates

Chapter Goals Chapter 4 Gates and Circuits Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors Combine basic gates into circuits Describe the

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

Chapter 4 Register Transfer and Microoperations Section 4.1 Register Transfer Language Digital systems are composed of modules that are constructed from digital components, such as registers, decoders,

### Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

### Let s put together a Manual Processor

Lecture 14 Let s put together a Manual Processor Hardware Lecture 14 Slide 1 The processor Inside every computer there is at least one processor which can take an instruction, some operands and produce

### CHAPTER 3 Boolean Algebra and Digital Logic

CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4

### Experiment 5. Arithmetic Logic Unit (ALU)

Experiment 5 Arithmetic Logic Unit (ALU) Objectives: To implement and test the circuits which constitute the arithmetic logic circuit (ALU). Background Information: The basic blocks of a computer are central

### Chapter 2 Logic Gates and Introduction to Computer Architecture

Chapter 2 Logic Gates and Introduction to Computer Architecture 2.1 Introduction The basic components of an Integrated Circuit (IC) is logic gates which made of transistors, in digital system there are

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

FORDHAM UNIVERSITY CISC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. Science Spring, 2011 Lab 2 The Full-Adder 1 Introduction In this lab, the student will construct

### Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction

### Chapter 5: Sequential Circuits (LATCHES)

Chapter 5: Sequential Circuits (LATCHES) Latches We focuses on sequential circuits, where we add memory to the hardware that we ve already seen Our schedule will be very similar to before: We first show

### Transparent D Flip-Flop

Transparent Flip-Flop The RS flip-flop forms the basis of a number of 1-bit storage devices in digital electronics. ne such device is shown in the figure, where extra combinational logic converts the input

### Digital Logic: Boolean Algebra and Gates

Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 CMPE2 Summer 28 Basic Logic Gates CMPE2 Summer 28 Slides by ADB 2 Truth Table The most basic representation of a logic function Lists the output

### l What have discussed up until now & why: l C Programming language l More low-level then Java. l Better idea about what s really going on.

CS211 Computer Architecture l Topics Digital Logic l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Class Checkpoint l What have discussed up until now & why: l C Programming

### Chapter 6 Digital Arithmetic: Operations & Circuits

Chapter 6 Digital Arithmetic: Operations & Circuits Chapter 6 Objectives Selected areas covered in this chapter: Binary addition, subtraction, multiplication, division. Differences between binary addition

### FORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. The Binary Adder

FORDHAM UNIVERITY CIC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. cience pring, 2011 1 Introduction The Binar Adder The binar adder circuit is an important building

### 4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION

4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

### The equation for the 3-input XOR gate is derived as follows

The equation for the 3-input XOR gate is derived as follows The last four product terms in the above derivation are the four 1-minterms in the 3-input XOR truth table. For 3 or more inputs, the XOR gate

### Module-3 SEQUENTIAL LOGIC CIRCUITS

Module-3 SEQUENTIAL LOGIC CIRCUITS Till now we studied the logic circuits whose outputs at any instant of time depend only on the input signals present at that time are known as combinational circuits.

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

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

### Programmable Logic Devices (PLDs)

Programmable Logic Devices (PLDs) Lesson Objectives: In this lesson you will be introduced to some types of Programmable Logic Devices (PLDs): PROM, PAL, PLA, CPLDs, FPGAs, etc. How to implement digital

### (Refer Slide Time: 00:01:16 min)

Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control

### NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

CHAPTER 4 THE ADDER The adder is one of the most critical components of a processor, as it is used in the Arithmetic Logic Unit (ALU), in the floating-point unit and for address generation in case of cache

### 2011, The McGraw-Hill Companies, Inc. Chapter 4

Chapter 4 4.1 The Binary Concept Binary refers to the idea that many things can be thought of as existing in only one of two states. The binary states are 1 and 0 The 1 and 0 can represent: ON or OFF Open

### 8-bit 4-to-1 Line Multiplexer

Project Part I 8-bit 4-to-1 Line Multiplexer Specification: This section of the project outlines the design of a 4-to-1 multiplexor which takes two 8-bit buses as inputs and produces a single 8-bit bus

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

Objectives Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. describe how such a flip-flop can be SET and RESET. describe the disadvantage

### #5. Show and the AND function can be constructed from two NAND gates.

Study Questions for Digital Logic, Processors and Caches G22.0201 Fall 2009 ANSWERS Digital Logic Read: Sections 3.1 3.3 in the textbook. Handwritten digital lecture notes on the course web page. Study

### CHAPTER TEN. 10.1 New Truth Table Symbols. 10.1.1 Edges/Transitions. Memory Cells

CHAPTER TEN Memory Cells The previous chapters presented the concepts and tools behind processing binary data. This is only half of the battle though. For example, a logic circuit uses inputs to calculate

### 1. Realization of gates using Universal gates

1. Realization of gates using Universal gates Aim: To realize all logic gates using NAND and NOR gates. Apparatus: S. No Description of Item Quantity 1. IC 7400 01 2. IC 7402 01 3. Digital Trainer Kit

### Binary Adder. sum of 2 binary numbers can be larger than either number need a carry-out to store the overflow

Binary Addition single bit addition Binary Adder sum of 2 binary numbers can be larger than either number need a carry-out to store the overflow Half-Adder 2 inputs (x and y) and 2 outputs (sum and carry)

### 3.Basic Gate Combinations

3.Basic Gate Combinations 3.1 TTL NAND Gate In logic circuits transistors play the role of switches. For those in the TTL gate the conducting state (on) occurs when the baseemmiter signal is high, and

### Two's Complement Adder/Subtractor Lab L03

Two's Complement Adder/Subtractor Lab L03 Introduction Computers are usually designed to perform indirect subtraction instead of direct subtraction. Adding -B to A is equivalent to subtracting B from A,

### Chapter 4. Arithmetic for Computers

Chapter 4 Arithmetic for Computers Arithmetic Where we've been: Performance (seconds, cycles, instructions) What's up ahead: Implementing the Architecture operation a b 32 32 ALU 32 result 2 Constructing

### COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

PH-315 COMINATIONAL and SEUENTIAL LOGIC CIRCUITS Hardware implementation and software design A La Rosa I PURPOSE: To familiarize with combinational and sequential logic circuits Combinational circuits

### Digital Electronics Detailed Outline

Digital Electronics Detailed Outline Unit 1: Fundamentals of Analog and Digital Electronics (32 Total Days) Lesson 1.1: Foundations and the Board Game Counter (9 days) 1. Safety is an important concept

### Counters and Decoders

Physics 3330 Experiment #10 Fall 1999 Purpose Counters and Decoders In this experiment, you will design and construct a 4-bit ripple-through decade counter with a decimal read-out display. Such a counter

### Figure 8-1 Four Possible Results of Adding Two Bits

CHPTER EIGHT Combinational Logic pplications Thus far, our discussion has focused on the theoretical design issues of computer systems. We have not yet addressed any of the actual hardware you might find

### Understanding Logic Design

Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1

### Integer multiplication

Integer multiplication Suppose we have two unsigned integers, A and B, and we wish to compute their product. Let A be the multiplicand and B the multiplier: A n 1... A 1 A 0 multiplicand B n 1... B 1 B

### CS311 Lecture: Sequential Circuits

CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce

### Boolean Algebra and Digital Circuits Part 3: Logic Gates and Combinatorial Circuits

Boolean Algebra and Digital Circuits Part 3: Logic Gates and Combinatorial Circuits Logic Gates a gate implements a simple boolean function such as AND, OR or NOT constructed using a few transistors basic

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

RAM & ROM Based Digital Design ECE 152A Winter 212 Reading Assignment Brown and Vranesic 1 Digital System Design 1.1 Building Block Circuits 1.1.3 Static Random Access Memory (SRAM) 1.1.4 SRAM Blocks in

### Basic Logic Gates Richard E. Haskell

BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that

### 2.0 Chapter Overview. 2.1 Boolean Algebra

Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital

### Chapter 2 Combinational Logic Circuits

Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits

### 4 Combinational Components

Chapter 4 Combinational Components Page of 8 4 Combinational Components In constructing large digital circuits, instead of starting with the basic gates as building blocks, we often start with larger building

### 2 1 Implementation using NAND gates: We can write the XOR logical expression A B + A B using double negation as

Chapter 2 Digital Logic asics 2 Implementation using NND gates: We can write the XOR logical expression + using double negation as + = + = From this logical expression, we can derive the following NND

### Aims and Objectives. E 3.05 Digital System Design. Course Syllabus. Course Syllabus (1) Programmable Logic

Aims and Objectives E 3.05 Digital System Design Peter Cheung Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.ic.ac.uk/pcheung/ E-mail: p.cheung@ic.ac.uk How to go

### Points Addressed in this Lecture

Points Addressed in this Lecture Lecture 3: Basic Logic Gates & Boolean Expressions Professor Peter Cheung Department of EEE, Imperial College London (Floyd 3.1-3.5, 4.1) (Tocci 3.1-3.9) What are the basic

### Sistemas Digitais I LESI - 2º ano

Sistemas Digitais I LESI - 2º ano Lesson 6 - Combinational Design Practices Prof. João Miguel Fernandes (miguel@di.uminho.pt) Dept. Informática UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA - PLDs (1) - The

### 150127-Microprocessor & Assembly Language

Chapter 3 Z80 Microprocessor Architecture The Z 80 is one of the most talented 8 bit microprocessors, and many microprocessor-based systems are designed around the Z80. The Z80 microprocessor needs an

### A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc

### Logical Operations. Control Unit. Contents. Arithmetic Operations. Objectives. The Central Processing Unit: Arithmetic / Logic Unit.

Objectives The Central Processing Unit: What Goes on Inside the Computer Chapter 4 Identify the components of the central processing unit and how they work together and interact with memory Describe how

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

Take-Home Exercise Assume you want the counter below to count mod-6 backward. That is, it would count 0-5-4-3-2-1-0, etc. Assume it is reset on startup, and design the wiring to make the counter count

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

Session ENG 206-6 Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course Nikunja Swain, Ph.D., PE South Carolina State University swain@scsu.edu Raghu Korrapati,

### Introduction. Logic. Most Difficult Reading Topics. Basic Logic Gates Truth Tables Logical Functions. COMP370 Introduction to Computer Architecture

Introduction LOGIC GATES COMP370 Introduction to Computer Architecture Basic Logic Gates Truth Tables Logical Functions Truth Tables Logical Expression Graphical l Form Most Difficult Reading Topics Logic

### Synchronous Sequential Logic. Logic and Digital System Design - CS 303 Erkay Savaş Sabanci University

Synchronous Sequential Logic Logic and Digital System Design - S 33 Erkay Savaş Sabanci University Sequential Logic Digital circuits we have learned, so far, have been combinational no memory, outputs

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

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots Registers As you probably know (if you don t then you should consider changing your course), data processing is usually

### Circuits and Boolean Expressions

Circuits and Boolean Expressions Provided by TryEngineering - Lesson Focus Boolean logic is essential to understanding computer architecture. It is also useful in program construction and Artificial Intelligence.

### Logic Gates & Operational Characteristics

Logic Gates & Operational Characteristics NOR Gate as a Universal Gate The NOR gate is also used as a Universal Gate as the NOR Gate can be used in a combination to perform the function of a AND, OR and

### Lecture 5: Gate Logic Logic Optimization

Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim

### Programming Logic controllers

Programming Logic controllers Programmable Logic Controller (PLC) is a microprocessor based system that uses programmable memory to store instructions and implement functions such as logic, sequencing,

### Lecture #21 April 2, 2004 Relays and Adder/Subtractors

Lecture #21 April 2, 2004 Relays and Adder/Subtractors In this lecture we look at a real technology for implementing gate circuits, as well as a more-or-less complete design for a general purpose adder/subtractor

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

Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2-valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and

### DEPARTMENT OF INFORMATION TECHNLOGY

DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453

### Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Lecture 9 - Register Transfer and Microoperations Microoperations Digital systems are modular in nature, with modules containing registers, decoders, arithmetic

### BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

### Lecture 10. Latches and Flip-Flops

Logic Design Lecture. Latches and Flip-Flops Prof. Hyung Chul Park & Seung Eun Lee Sequential Logic Outputs of sequential logic depend on current inputs and prior input values Sequential logic might explicitly

### Flip-Flops, Registers, Counters, and a Simple Processor

June 8, 22 5:56 vra235_ch7 Sheet number Page number 349 black chapter 7 Flip-Flops, Registers, Counters, and a Simple Processor 7. Ng f3, h7 h6 349 June 8, 22 5:56 vra235_ch7 Sheet number 2 Page number

### Computer Architecture

Computer Architecture Having studied numbers, combinational and sequential logic, and assembly language programming, we begin the study of the overall computer system. The term computer architecture is

### Module 2. Embedded Processors and Memory. Version 2 EE IIT, Kharagpur 1

Module 2 Embedded Processors and Memory Version 2 EE IIT, Kharagpur 1 Lesson 5 Memory-I Version 2 EE IIT, Kharagpur 2 Instructional Objectives After going through this lesson the student would Pre-Requisite

### CS101 Lecture 26: Low Level Programming. John Magee 30 July 2013 Some material copyright Jones and Bartlett. Overview/Questions

CS101 Lecture 26: Low Level Programming John Magee 30 July 2013 Some material copyright Jones and Bartlett 1 Overview/Questions What did we do last time? How can we control the computer s circuits? How

### Addressing The problem. When & Where do we encounter Data? The concept of addressing data' in computations. The implications for our machine design(s)

Addressing The problem Objectives:- When & Where do we encounter Data? The concept of addressing data' in computations The implications for our machine design(s) Introducing the stack-machine concept Slide

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

A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 24 p. 1/20 EE 42/100 Lecture 24: Latches and Flip Flops ELECTRONICS Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad University of California,

### ANALOG & DIGITAL ELECTRONICS

ANALOG & DIGITAL ELECTRONICS Course Instructor: Course No: PH-218 3-1-0-8 Dr. A.P. Vajpeyi E-mail: apvajpeyi@iitg.ernet.in Room No: #305 Department of Physics, Indian Institute of Technology Guwahati,

### Sequential Logic. (Materials taken from: Principles of Computer Hardware by Alan Clements )

Sequential Logic (Materials taken from: Principles of Computer Hardware by Alan Clements ) Sequential vs. Combinational Circuits Combinatorial circuits: their outputs are computed entirely from their present

### Part 2: Operational Amplifiers

Part 2: Operational Amplifiers An operational amplifier is a very high gain amplifier. Op amps can be used in many different ways. Two of the most common uses are a) as comparators b) as amplifiers (either

### Chapter 2 Digital Components. Section 2.1 Integrated Circuits

Chapter 2 Digital Components Section 2.1 Integrated Circuits An integrated circuit (IC) is a small silicon semiconductor crystal, called a chip, containing the electronic components for the digital gates

### Hardware: Input, Processing, and Output Devices

Hardware: Input, Processing, and Output Devices Computer Systems Hardware Components Execution of an Instruction Processing Characteristics and Functions Physical Characteristics of CPU Memory Characteristics

### MICROPROCESSOR AND MICROCOMPUTER BASICS

Introduction MICROPROCESSOR AND MICROCOMPUTER BASICS At present there are many types and sizes of computers available. These computers are designed and constructed based on digital and Integrated Circuit

### Electronic Troubleshooting. Chapter 10 Digital Circuits

Electronic Troubleshooting Chapter 10 Digital Circuits Digital Circuits Key Aspects Logic Gates Inverters NAND Gates Specialized Test Equipment MOS Circuits Flip-Flops and Counters Logic Gates Characteristics

### CHAPTER 16 Memory Circuits

CHAPTER 16 Memory Circuits Introduction! The 2 major logic classifications are! Combinational circuits: Their output depends only on the present value of the input. These circuits do not have memory.!

### Computer Systems Structure Main Memory Organization

Computer Systems Structure Main Memory Organization Peripherals Computer Central Processing Unit Main Memory Computer Systems Interconnection Communication lines Input Output Ward 1 Ward 2 Storage/Memory

### Figure 2.1(a) Bistable element circuit.

3.1 Bistable Element Let us look at the inverter. If you provide the inverter input with a 1, the inverter will output a 0. If you do not provide the inverter with an input (that is neither a 0 nor a 1),

### STEP Basics of PLCs

STEP 2000 Basics of PLCs Table of Contents Introduction...2 PLCs...4 Number Systems...8 Terminology...14 Basic Requirements...23 S7-200 Micro PLCs...28 Connecting External Devices...39 Programming A PLC...41

### Lab 1: Full Adder 0.0

Lab 1: Full Adder 0.0 Introduction In this lab you will design a simple digital circuit called a full adder. You will then use logic gates to draw a schematic for the circuit. Finally, you will verify

### Signed Binary Arithmetic

Signed Binary Arithmetic In the real world of mathematics, computers must represent both positive and negative binary numbers. For example, even when dealing with positive arguments, mathematical operations

### ELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits

Objectives ELEC - EXPERIMENT Basic Digital Logic Circuits The experiments in this laboratory exercise will provide an introduction to digital electronic circuits. You will learn how to use the IDL-00 Bit

### 8-bit Digital to Analog converter (DAC)

8-bit Digital to Analog converter (DAC) Posted on February 28, 2008, by Ibrahim KAMAL, in General electronics, tagged This article aims to introduce to beginners and intermediate readers a simple solution

INTEGRATED CIRCUITS DATA SHEET For a complete data sheet, please also download: The IC06 74HC/HCT/HCU/HCMOS Logic Family Specifications The IC06 74HC/HCT/HCU/HCMOS Logic Package Information The IC06 74HC/HCT/HCU/HCMOS

### CHAPTER 2: HARDWARE BASICS: INSIDE THE BOX

CHAPTER 2: HARDWARE BASICS: INSIDE THE BOX Multiple Choice: 1. Processing information involves: A. accepting information from the outside world. B. communication with another computer. C. performing arithmetic

### Homework # 2. Solutions. 4.1 What are the differences among sequential access, direct access, and random access?

ECE337 / CS341, Fall 2005 Introduction to Computer Architecture and Organization Instructor: Victor Manuel Murray Herrera Date assigned: 09/19/05, 05:00 PM Due back: 09/30/05, 8:00 AM Homework # 2 Solutions

### ECE3281 Electronics Laboratory

ECE328 Electronics Laboratory Experiment #4 TITLE: EXCLUSIVE-OR FUNCTIONS and INRY RITHMETIC OJECTIVE: Synthesize exclusive-or and the basic logic functions necessary for execution of binary arithmetic.

### ENGI 241 Experiment 5 Basic Logic Gates

ENGI 24 Experiment 5 Basic Logic Gates OBJECTIVE This experiment will examine the operation of the AND, NAND, OR, and NOR logic gates and compare the expected outputs to the truth tables for these devices.

### Digital-to-Analog Conversion

Digital-to-Analog Conversion Curtis A. Nelson Engr355 1 Introduction Connecting digital circuitry to sensor devices is simple if the sensor devices are inherently digital themselves. Switches, relays,

### Combinational Logic. Combinational Circuits in Computers (Examples) Design of Combinational Circuits. CC Design Example

Combinational Circuits in Computers (Examples) Combinational Logic Translates a set of Boolean n input variables ( or ) by a mapping function (using Boolean operations) to produce a set of Boolean m output