Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction
|
|
- Bruce Lambert
- 7 years ago
- Views:
Transcription
1 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 5 volts =. Gates calculate various functions of 2 values (like ND). Computers are made up of gates. Gates are made of connected transistors (which are digital circuits). CS 6 Ward CS 6 Ward 2 Combinational Logic Translates a set of n input variables ( or ) by a mapping function (using Boolean operations) to produce a set of m output variables ( or ). i f = F (i,i,, i n- ) i f = F (i,i,, i n- ) F i n- f m- = F m- (i,i,, i n- ) Boolean Operators Basic operators NOT ND OR Other useful operators NND NOR XOR XNOR CS 6 Ward 3 CS 6 Ward 4
2 NOT (inverter) Operator [] NOT Operator [2] goes in, comes out and vice versa NOT truth table Simplified Circuit: When input (base) V in is low, transistor turns off (infinite resistance) which means output is V cc (typically 5 volts) ( in = out) +5 volts resistor X X = When V in is high, transistor acts like a wire to ground making output volts ( in = out) NOT gate symbol Time to make output change values is a few nanoseconds volts X Inversion bubble CS 6 Ward 5 CS 6 Ward 6 ND Operator NND Operator [] ND truth table B X X = B NND truth table (not and) X = B ND gate symbol B X NND gate symbol Circuit: NOT connected to a NND (next 2 slides) CS 6 Ward 7 CS 6 Ward 8
3 NND Operator [2] OR Operator Simplified Circuit: If V and V 2 are both high, both transistors will conduct and send the electricity to ground and V out will be low If either V or V 2 (or both) are low, the corresponding transistor resists, not allowing electricity to ground and output is high OR truth table B X X = + B OR gate symbol Circuit: NOT connected to NOR (next 2 slides) CS 6 Ward 9 CS 6 Ward NOR Operator [] NOR Operator [2] NOR truth table (not or) B X X = + B NOR gate symbol Simplified Circuit: If either input V or V 2 is high then transistor will conduct electricity to ground and output will be low If both inputs are low then both transistors resist, making output high CS 6 Ward CS 6 Ward 2
4 NOR Operator [3] XOR Operator ctual Circuit: Exclusive-OR example Truth table XOR = B = B + B 6 transistors, 5 resistors, & 3 diodes Symbol: CS 6 Ward 3 CS 6 Ward 4 XNOR Operator Gate Manufacturing Technology Exclusive-NOR example Truth table XNOR = B = B + B Symbol: XNO R Bipolar TTL (Transistor-Transistor Logic) workhorse of digital electronics ECL (Emitter-Coupled Logic) very fast MOS (Metal Oxide Semiconductor) slower than bipolar but needs less power and takes up less space so can put a lot on one chip PMOS NMOS CMOS (most modern CPU s and memories) CS 6 Ward 5 CS 6 Ward 6
5 Boolean Functions combination of Boolean operators F (,B,C) = + BC F 2 (,B,C) = BC + BC + BC + BC = C (by minimizing techniques shown later) Majority Function Truth Table majority function for 3 inputs ( if most inputs are, if most inputs are ) M (, B, C) B C M Recall: + operator means OR & no operator ( B C ) means ND CS 6 Ward 7 CS 6 Ward 8 Majority Function Circuit B C B C _ Majority Boolean Function dash () means (not ) Dots are connections Boolean algebra function for the majority function: M = B C + B C + B C + B C How was this formula (and circuit on previous slide) derived? CS 6 Ward 9 CS 6 Ward 2
6 Boolean Function from Truth Table [] Boolean Function from Truth Table [2] Boolean algebra function can be derived from any truth table For each in result, ND the row values (use NOT to make row values ) then OR those together Example: Draw circuit for function: X = B + B B X _ ND these rows: B B _ then OR them: B + B X = B + B sum-of-product (sop) form for function CS 6 Ward 2 CS 6 Ward 22 Circuits from SOP Functions [] Steps to implement a circuit:. Write down truth table 2. Provide inverters (NOTs) to generate complement of each input 3. Draw an ND gate for each term with as result 4. Wire the ND gates to inputs 5. Feed outputs of all ND gates to an OR gate 6. Simplify circuit, e.g:. Replace NOT ND with NND, NOT OR with NOR (for efficiency) 2. Replace large-number-of-input (say ) gates with many smaller-number-of-input (<) input gates (for efficiency and timing) Circuits from SOP Functions [2] Why simplification? NND and NOR gates are simpler (faster, smaller) than NOT ND and NOT OR Simpler, faster (?) to use small number of gate types Ultimately, want to implement circuit using a small complete set of operators (discussed later) NND and NOR are both complete because any Boolean function can be implemented with either Faster to use small number of inputs to a gate (fan-in) and small number of gate inputs from a gate output (fan-out) Typically, fan-in and fan-out limited to < CS 6 Ward 23 CS 6 Ward 24
7 Cascading to Reduce Inputs Basic Laws of Boolean lgebra Boolean algebra follows many algebra rules which can be used to make simpler circuits Example: B + C = ( B + C ) (3 gates vs 2 gates) CS 6 Ward 25 CS 6 Ward 26 Equivalent Gates/Symbols From these Boolean laws (identities), alternative symbols (implementations) for some gates can be derived: NND ND NOR OR Functionally Complete Sets of Gates Not all gate types are typically implemented in circuit design. Simpler if only or 2 types of gates are used. functionally complete set of gates means that any Boolean function can be implemented using only the gates in the set. Examples of functionally complete set ND, OR, NOT ND, NOT OR, NOT NND NOR CS 6 Ward 27 CS 6 Ward 28
8 NND & NOR Completeness Implement XOR with NNDs [] Exclusive-OR example Truth table (step ) First circuit from truth table (steps 2 5) Making (a) NOT, (b) ND, (c) OR with NND or NOR XOR = B = B + B CS 6 Ward 29 CS 6 Ward 3 Implement XOR with NNDs [2] Using Boolean algebra rules Implement XOR with NNDs [3] Circuits implementing XOR (in addition to the one given from sop on slide 29): Last formula is 3 NND gates (see next slide) CS 6 Ward 3 CS 6 Ward 32
9 Simplification Other Examples Boolean functions (and therefore circuits) can frequently be manipulated using Boolean laws into simpler functions (circuits), e.g., BC + C + B = (BC + B + C) = (BC + BC) ( + B) ( + B) = ( + B) + ( + B)B = + B + B + BB = ( + B + B) + = = ( + B) ( + B) (BC + B + C) = ( + ) = () = (previous slide) (above) = CS 6 Ward 33 CS 6 Ward 34 XOR Operations [] Recall XOR = B = B + B ( if B; otherwise ) XOR Operations [2] XOR = B = B + B = + = = + = = + = = + = B C = ( B) C = ( B)C + ( B)C = (B + B)C + (B + B)C B = B + B = B B = B + B = B Verify on your own Hint: start with the definition of XNOR = BC + BC + BC + BC (sop form) CS 6 Ward 35 CS 6 Ward 36
10 Ward 37 CS 6 B C Truth Table B C C B Thus, output TRUE iff odd-number of Boolean variables are TRUE. Used for memory check.
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
More informationGates, 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
More informationLecture 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
More information1. 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
More informationUnderstanding 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
More informationBOOLEAN 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
More informationDigital 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
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationDigital 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
More informationAnalog & Digital Electronics Course No: PH-218
Analog & Digital Electronics Course No: PH-218 Lec-28: Logic Gates & Family Course Instructor: Dr. A. P. VAJPEYI Department of Physics, Indian Institute of Technology Guwahati, India 1 Digital Logic Gates
More informationChapter 10 Advanced CMOS Circuits
Transmission Gates Chapter 10 Advanced CMOS Circuits NMOS Transmission Gate The active pull-up inverter circuit leads one to thinking about alternate uses of NMOS devices. Consider the circuit shown in
More informationNEW 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
More informationCHAPTER 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
More informationElementary Logic Gates
Elementary Logic Gates Name Symbol Inverter (NOT Gate) ND Gate OR Gate Truth Table Logic Equation = = = = = + C. E. Stroud Combinational Logic Design (/6) Other Elementary Logic Gates NND Gate NOR Gate
More informationDigital Logic Elements, Clock, and Memory Elements
Physics 333 Experiment #9 Fall 999 Digital Logic Elements, Clock, and Memory Elements Purpose This experiment introduces the fundamental circuit elements of digital electronics. These include a basic set
More informationENGI 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.
More informationSum-of-Products and Product-of-Sums expressions
Sum-of-Products and Product-of-Sums expressions This worksheet and all related files are licensed under the reative ommons ttribution License, version.. To view a copy of this license, visit http://creativecommons.org/licenses/by/./,
More informationLogic 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
More informationDigital 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
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationKarnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation
Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated
More informationCounters 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
More informationTwo-level logic using NAND gates
CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place
More informationUnit 3 Boolean Algebra (Continued)
Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication
More informationFORDHAM 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
More informationHere we introduced (1) basic circuit for logic and (2)recent nano-devices, and presented (3) some practical issues on nano-devices.
Outline Here we introduced () basic circuit for logic and (2)recent nano-devices, and presented (3) some practical issues on nano-devices. Circuit Logic Gate A logic gate is an elemantary building block
More informationChapter 6 TRANSISTOR-TRANSISTOR LOGIC. 3-emitter transistor.
Chapter 6 TRANSISTOR-TRANSISTOR LOGIC The evolution from DTL to TTL can be seen by observing the placement of p-n junctions. For example, the diode D2 from Figure 2 in the chapter on DTL can be replaced
More informationUpon completion of unit 1.1, students will be able to
Upon completion of unit 1.1, students will be able to 1. Demonstrate safety of the individual, class, and overall environment of the classroom/laboratory, and understand that electricity, even at the nominal
More informationECE124 Digital Circuits and Systems Page 1
ECE124 Digital Circuits and Systems Page 1 Chip level timing Have discussed some issues related to timing analysis. Talked briefly about longest combinational path for a combinational circuit. Talked briefly
More informationGates. J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, TX 77251
Gates J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, T 77251 1. The Evolution of Electronic Digital Devices...1 2. Logical Operations and the Behavior of Gates...2
More informationOptimization and Comparison of 4-Stage Inverter, 2-i/p NAND Gate, 2-i/p NOR Gate Driving Standard Load By Using Logical Effort
Optimization and Comparison of -Stage, -i/p NND Gate, -i/p NOR Gate Driving Standard Load By Using Logical Effort Satyajit nand *, and P.K.Ghosh ** * Mody Institute of Technology & Science/ECE, Lakshmangarh,
More informationANALOG & 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,
More informationKarnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012
Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology
More informationThe MOSFET Transistor
The MOSFET Transistor The basic active component on all silicon chips is the MOSFET Metal Oxide Semiconductor Field Effect Transistor Schematic symbol G Gate S Source D Drain The voltage on the gate controls
More informationBasic 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
More informationCOMBINATIONAL 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
More informationSeries and Parallel Circuits
Direct Current (DC) Direct current (DC) is the unidirectional flow of electric charge. The term DC is used to refer to power systems that use refer to the constant (not changing with time), mean (average)
More informationCpE358/CS381. Switching Theory and Logical Design. Class 4
Switching Theory and Logical Design Class 4 1-122 Today Fundamental concepts of digital systems (Mano Chapter 1) Binary codes, number systems, and arithmetic (Ch 1) Boolean algebra (Ch 2) Simplification
More informationUsing Op Amps As Comparators
TUTORIAL Using Op Amps As Comparators Even though op amps and comparators may seem interchangeable at first glance there are some important differences. Comparators are designed to work open-loop, they
More informationTable 1 Comparison of DC, Uni-Polar and Bi-polar Stepper Motors
Electronics Exercise 3: Uni-Polar Stepper Motor Controller / Driver Mechatronics Instructional Laboratory Woodruff School of Mechanical Engineering Georgia Institute of Technology Lab Director: I. Charles
More informationEXPERIMENT 3: TTL AND CMOS CHARACTERISTICS
EXPERIMENT 3: TTL AND CMOS CHARACTERISTICS PURPOSE Logic gates are classified not only by their logical functions, but also by their logical families. In any implementation of a digital system, an understanding
More informationChapter 3 Digital Basics
Chapter 3 Digital asics We conclude our review of basic concepts with a survey of topics from digital electronics. We confine our attention to aspects that are important in the understanding of simple
More informationCSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps
CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms
More informationAdder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits
Adder.T(//29) 5. Lecture 3 Adder ircuits Objectives Understand how to add both signed and unsigned numbers Appreciate how the delay of an adder circuit depends on the data values that are being added together
More informationCS311 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
More informationUnited States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1
United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.
More informationField-Effect (FET) transistors
Field-Effect (FET) transistors References: Hayes & Horowitz (pp 142-162 and 244-266), Rizzoni (chapters 8 & 9) In a field-effect transistor (FET), the width of a conducting channel in a semiconductor and,
More informationThe components. E3: Digital electronics. Goals:
E3: Digital electronics Goals: Basic understanding of logic circuits. Become familiar with the most common digital components and their use. Equipment: 1 st. LED bridge 1 st. 7-segment display. 2 st. IC
More informationFigure 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
More information6. BOOLEAN LOGIC DESIGN
6. OOLEN LOGI DESIGN 89 Topics: oolean algebra onverting between oolean algebra and logic gates and ladder logic Logic examples Objectives: e able to simplify designs with oolean algebra 6. INTRODUTION
More informationBoolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010
Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an
More information3.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
More informationLecture 5: Logical Effort
Introduction to CMOS VLSI Design Lecture 5: Logical Effort David Harris Harvey Mudd College Spring 2004 Outline Introduction Delay in a Logic Gate Multistage Logic Networks Choosing the Best Number of
More informationNAND and NOR Implementation
University of Wisconsin - Madison EE/omp ci 352 Digital ystems Fundamentals harles R. Kime ection 2 Fall 200 hapter 2 ombinational Logic ircuits Part 7 harles Kime & Thomas Kaminski NND and NOR Implementation
More informationModule 7 : I/O PADs Lecture 33 : I/O PADs
Module 7 : I/O PADs Lecture 33 : I/O PADs Objectives In this lecture you will learn the following Introduction Electrostatic Discharge Output Buffer Tri-state Output Circuit Latch-Up Prevention of Latch-Up
More informationEGR 278 Digital Logic Lab File: N278L3A Lab # 3 Open-Collector and Driver Gates
EGR 278 Digital Logic Lab File: N278L3A Lab # 3 Open-Collector and Driver Gates A. Objectives The objectives of this laboratory are to investigate: the operation of open-collector gates, including the
More informationExperiment #5, Series and Parallel Circuits, Kirchhoff s Laws
Physics 182 Summer 2013 Experiment #5 1 Experiment #5, Series and Parallel Circuits, Kirchhoff s Laws 1 Purpose Our purpose is to explore and validate Kirchhoff s laws as a way to better understanding
More informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043
INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 ELECTRONICS AND COMMUNICATION ENGINEERING Course Title VLSI DESIGN Course Code 57035 Regulation R09 COURSE DESCRIPTION Course Structure
More informationChapter 2: Boolean Algebra and Logic Gates. Boolean Algebra
The Universit Of Alabama in Huntsville Computer Science Chapter 2: Boolean Algebra and Logic Gates The Universit Of Alabama in Huntsville Computer Science Boolean Algebra The algebraic sstem usuall used
More informationA Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN
A Course Material on By MS.G.MANJULA ASSISTANT PROFESSOR DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING SASURIE COLLEGE OF ENGINEERING VIJAYAMANGALAM 638 56 QUALITY CERTIFICATE This is to certify
More informatione.g. τ = 12 ps in 180nm, 40 ps in 0.6 µm Delay has two components where, f = Effort Delay (stage effort)= gh p =Parasitic Delay
Logic Gate Delay Chip designers need to choose: What is the best circuit topology for a function? How many stages of logic produce least delay? How wide transistors should be? Logical Effort Helps make
More informationMixed Logic A B A B. 1. Ignore all bubbles on logic gates and inverters. This means
Mixed Logic Introduction Mixed logic is a gate-level design methodology used in industry. It allows a digital logic circuit designer the functional description of the circuit from its physical implementation.
More informationCSE140: Components and Design Techniques for Digital Systems
CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
CHAPTER3 QUESTIONS MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. ) If one input of an AND gate is LOW while the other is a clock signal, the output
More informationFORDHAM 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
More informationEE 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,
More informationOPERATIONAL AMPLIFIERS
INTRODUCTION OPERATIONAL AMPLIFIERS The student will be introduced to the application and analysis of operational amplifiers in this laboratory experiment. The student will apply circuit analysis techniques
More informationPass Gate Logic An alternative to implementing complex logic is to realize it using a logic network of pass transistors (switches).
Pass Gate Logic n alternative to implementing complex logic is to realize it using a logic network of pass transistors (switches). Switch Network Regeneration is performed via a buffer. We have already
More informationCMOS Logic Integrated Circuits
CMOS Logic Integrated Circuits Introduction CMOS Inverter Parameters of CMOS circuits Circuits for protection Output stage for CMOS circuits Buffering circuits Introduction Symetrical and complementary
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationUsing Logic to Design Computer Components
CHAPTER 13 Using Logic to Design Computer Components Parallel and sequential operation In this chapter we shall see that the propositional logic studied in the previous chapter can be used to design digital
More informationChapter 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
More informationexclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576
exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking
More informationLogic gates. Chapter. 9.1 Logic gates. MIL symbols. Learning Summary. In this chapter you will learn about: Logic gates
Chapter 9 Logic gates Learning Summary In this chapter you will learn about: Logic gates Truth tables Logic circuits/networks In this chapter we will look at how logic gates are used and how truth tables
More informationGRADE 11A: Physics 5. UNIT 11AP.5 6 hours. Electronic devices. Resources. About this unit. Previous learning. Expectations
GRADE 11A: Physics 5 Electronic devices UNIT 11AP.5 6 hours About this unit This unit is the fifth of seven units on physics for Grade 11 advanced. The unit is designed to guide your planning and teaching
More informationLecture 8: Synchronous Digital Systems
Lecture 8: Synchronous Digital Systems The distinguishing feature of a synchronous digital system is that the circuit only changes in response to a system clock. For example, consider the edge triggered
More informationLab 5 Operational Amplifiers
Lab 5 Operational Amplifiers By: Gary A. Ybarra Christopher E. Cramer Duke University Department of Electrical and Computer Engineering Durham, NC. Purpose The purpose of this lab is to examine the properties
More informationCSE140: Components and Design Techniques for Digital Systems. Introduction. Prof. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Introduction Prof. Tajana Simunic Rosing Welcome to CSE 4! Instructor: Tajana Simunic Rosing Email: tajana@ucsd.edu; please put CSE4 in the subject
More informationInterfacing 3V and 5V applications
Authors: Tinus van de Wouw (Nijmegen) / Todd Andersen (Albuquerque) 1.0 THE NEED FOR TERFACG BETWEEN 3V AND 5V SYSTEMS Many reasons exist to introduce 3V 1 systems, notably the lower power consumption
More informationLogic Reference Guide
Logic eference Guide Advanced Micro evices INTOUCTION Throughout this data book and design guide we have assumed that you have a good working knowledge of logic. Unfortunately, there always comes a time
More informationCombinational Logic Design
Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra
More informationGate Delay Model. Estimating Delays. Effort Delay. Gate Delay. Computing Logical Effort. Logical Effort
Estimating Delays Would be nice to have a back of the envelope method for sizing gates for speed Logical Effort Book by Sutherland, Sproull, Harris Chapter 1 is on our web page Also Chapter 4 in our textbook
More informationDiodes have an arrow showing the direction of the flow.
The Big Idea Modern circuitry depends on much more than just resistors and capacitors. The circuits in your computer, cell phone, Ipod depend on circuit elements called diodes, inductors, transistors,
More information2.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
More informationERROR DETECTION AND CORRECTION
Supplement to Logic and Computer Design Fundamentals 3rd Edition 1 ERROR DETECTION AND CORRECTION Selected topics not covered in the third edition of Logic and Computer Design Fundamentals are provided
More informationCONTENTS PREFACE 1 INTRODUCTION 1 2 NUMBER SYSTEMS AND CODES 25. vii
2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is CONTENTS PREFACE xv 1 INTRODUCTION 1 1.1 About Digital Design 1 1.2 Analog versus Digital 3 1.3 Digital Devices
More informationSistemas 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
More informationBasic Electronics Prof. Dr. Chitralekha Mahanta Department of Electronics and Communication Engineering Indian Institute of Technology, Guwahati
Basic Electronics Prof. Dr. Chitralekha Mahanta Department of Electronics and Communication Engineering Indian Institute of Technology, Guwahati Module: 2 Bipolar Junction Transistors Lecture-2 Transistor
More informationSmall Signal Analysis of a PMOS transistor Consider the following PMOS transistor to be in saturation. Then, 1 2
Small Signal Analysis of a PMOS transistor Consider the following PMOS transistor to be in saturation. Then, 1 I SD = µ pcox( VSG Vtp)^2(1 + VSDλ) 2 From this equation it is evident that I SD is a function
More informationLFSR BASED COUNTERS AVINASH AJANE, B.E. A technical report submitted to the Graduate School. in partial fulfillment of the requirements
LFSR BASED COUNTERS BY AVINASH AJANE, B.E A technical report submitted to the Graduate School in partial fulfillment of the requirements for the degree Master of Science in Electrical Engineering New Mexico
More information6 Series Parallel Circuits
6 Series Parallel Circuits This work is licensed under the Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/3.0/. Air Washington
More informationBIPOLAR JUNCTION TRANSISTORS
CHAPTER 3 BIPOLAR JUNCTION TRANSISTORS A bipolar junction transistor, BJT, is a single piece of silicon with two back-to-back P-N junctions. However, it cannot be made with two independent back-to-back
More informationLayout of Multiple Cells
Layout of Multiple Cells Beyond the primitive tier primitives add instances of primitives add additional transistors if necessary add substrate/well contacts (plugs) add additional polygons where needed
More informationKirchhoff's Current Law (KCL)
Kirchhoff's Current Law (KCL) I. Charge (current flow) conservation law (the Kirchhoff s Current law) Pipe Pipe Pipe 3 Total volume of water per second flowing through pipe = total volume of water per
More informationHaving 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
More informationChapter 19 Operational Amplifiers
Chapter 19 Operational Amplifiers The operational amplifier, or op-amp, is a basic building block of modern electronics. Op-amps date back to the early days of vacuum tubes, but they only became common
More informationSwitching Algebra and Logic Gates
Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationECL: Emitter-Coupled Logic
Emitter-Coupled ogic EC EC: Emitter-Coupled ogic The key to reducing propagati delay in a bipolar logic family is to prevent a gate s transistors from saturating. Secti BJT.3 shows how Schottky diodes
More information