Acknowledgement: Overheads adapted from those provided by the authors of the textbook Logic Circuits Mehmet Can Vuran, Instructor University of Nebraska-Lincoln.

Slides:



Advertisements
Similar presentations
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Advertisements

Programmable Logic Controllers.
Instructor Dr Sameh Abdulatif
Documentation Standards
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
CS370 – Spring 2003 Programmable Logic Devices PALs/PLAs.
Boolean Algebra and Reduction Techniques
Appendix A Logic Circuits. Logic circuits Operate on binary variables that assume one of two distinct values, usually called 0 and 1 Implement functions.
Programmable Logic Controllers
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Prof. Kavita Bala and Prof. Hakim Weatherspoon CS 3410, Spring 2014 Computer Science Cornell University See: P&H Appendix B.2 and B.3 (Also, see B.0 and.
2.7 NAND and NOR logic networks
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
ROM & PLA Digital Logic And Computer Design
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Basic logic gates  AND gate:The truth table is given by A.BBA
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Programmable Logic Devices (PLDs)
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
Boolean Algebra and Reduction Techniques
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.
CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.
Basic Logic Operations and Standard Logic Gates [Lecture:1] Instructor: Sajib Roy Lecturer, ETE, ULAB ETE 204 – Digital Electronics.
Logic and Computer Design Fundamentals, Fifth Edition Mano | Kime | Martin Copyright ©2016, 2008, 2004 by Pearson Education, Inc. All rights reserved.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
ECE DIGITAL LOGIC LECTURE 5: BINARY LOGIC AND DIGITAL LOGIC GATES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/28/2016.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. Chapter 7 Logic Circuits.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Digital Logic. Boolean Algebra to Logic Gates Logic circuits are built from components called logic gates. The logic gates correspond to Boolean operations.
Eng. Mai Z. Alyazji October, 2016
Transistors and Logic Circuits
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Logic gates Boolean Algebra
ECE 331 – Digital System Design
Overview Part 1 – Gate Circuits and Boolean Equations
Digital Logic.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
ECE 434 Advanced Digital System L03
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Computer Science 210 Computer Organization
ECE434a Advanced Digital Systems L02
Logic Gates.
13 Digital Logic Circuits.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Chapter 10.3 and 10.4: Combinatorial Circuits
Logic Gates.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
FIGURE 5-1 MOS Transistor, Symbols, and Switch Models
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Presentation transcript:

Acknowledgement: Overheads adapted from those provided by the authors of the textbook Logic Circuits Mehmet Can Vuran, Instructor University of Nebraska-Lincoln

CSCE Computer Organization2

3

 Programmable  Software ▪ Typically, use single-board microcontrollers to implement the logic by a program  Programmable logic devices (PLDs) and field programmable gate arrays (FPGAs) ▪ Devices in which the logic elements and the interconnect (wiring) can be modified by programming. ▪ Ideal for rapid prototyping and low-volume applications.  ROMs  Custom Designs  How Intel designs microprocessors  Cost-effective only for high-volume parts CSCE Computer Organization4

 Operate on binary variables that assume one of two distinct values, usually called 0 and 1  Implement functions of logic variables  Circuits have inputs and outputs  Circuits are implemented using electronic logic gates

AND OR NOT B A B A C B A C 6CSCE Computer Organization

ABC B A B A C B A C AND 7CSCE Computer Organization

ABC B A B A C B A C AND 8CSCE Computer Organization

ABC B A B A C B A C ABC ANDOR 9CSCE Computer Organization

ABC B A B A C B A C ABC ANDOR 10CSCE Computer Organization

NOT ABC B A B A C B A C ABC AB 0 1 ANDOR 11CSCE Computer Organization

NOT ABC B A B A C B A C ABC AB ANDOR 12CSCE Computer Organization

ABXOR CSCE Computer Organization

ABXOR CSCE Computer Organization

Light switch example

 Operate on binary variables that assume one of two distinct values, usually called 0 and 1  Why?  Let’s back up…

ABNAND Not AND  NAND

ABNAND

NOT AB 01 10

AND ABC

OR ABC

ABC

XOR ABC

NOR ABC

XNOR ABC

ABXOR

 Synthesis is the process of designing and implementing a logic circuit defined by its functional specification.  The expression for f in the previous circuit is said to be in a sum-of-products form  OR and AND operations are sometimes called the sum and product functions.

 Show a logic equation for the three functions shown in the following truth table: 39CSCE Computer Organization

 As illustrated in the previous example, a logic function can be implemented with circuits of different complexities.  It is useful to minimize a logic expression to reduce the cost of the synthesized circuit.

41

Four-variable Karnaugh maps

Using don’t cares

48

NMOS Transistor

PMOS Transistor

 Cannot directly connect logic gates  May damage the circuits in certain input combinations  May not need ALL the gates together  If a gate is not SELECTED, it should not provide 1 or 0  Need a third output – Z (high impedance) 62

 HW 3 – Chapter 3  Assign Friday, Sept. 27 th  Due Wednesday, Oct. 9 th  Test 1 – Chapters 1-2  Monday, Oct. 7 th (50 min)  Quiz 3 – Chapter 3  Friday, Oct. 11 th (15 min) 64