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


 Morgan Wood
 2 years ago
 Views:
Transcription
1 CS211 Computer Architecture l Topics Digital Logic l Transistors (Design & Types) l Logic Gates l Combinational Circuits l KMaps Class Checkpoint l What have discussed up until now & why: l C Programming language l More lowlevel then Java. l Better idea about what s really going on. l Covered data representation l Computers manipulate data. How is this data stored and manipulated? l Covered MachineLevel representation of programs (assembly lanaguage  x86) l Computers don t work on C code (or Java). Need instructions closer to hardware. l What s next? Processor Design how does machine instructions actually make the processor work? Figures & Tables borrowed from:! But first l Before we go into processor design, we re going to cover some topics in Digital Logic. l Book covers this only sparingly, we re going to go into a bit more detail. l Specifically: l Transistors l Logic gates l Combinational & Sequential Circuits l FlipFlops l Memory Transistor: Building Block of Computers l Microprocessors contain millions of transistors l Intel Pentium 4 (2000): 48 million l IBM PowerPC 750FX (2002): 38 million l IBM/Apple PowerPC G5 (2003): 58 million l Logically, each transistor acts as a switch l Combined to implement logic functions l AND, OR, NOT l Combined to build higherlevel structures l Adder, multiplexer, decoder, register, l Combined to build processor 1
2 Simple Switch Circuit ntype MOS Transistor l Switch open: l No current through circuit l Light is off l V out is +2.9V l Switch closed: l Short circuit across switch l Current flows l Light is on l V out is 0V Switchbased circuits can easily represent two states: on/off, open/closed, voltage/no voltage. l MOS = Metal Oxide Semiconductor l two types: ntype and ptype l ntype l when Gate has positive voltage, short circuit between #1 and #2 (switch closed) l when Gate has zero voltage, open circuit between #1 and #2 (switch open) Terminal #2 must be connected to GND (0V). Gate = 1 Gate = 0 ptype MOS Transistor l ptype is complementary to ntype l when Gate has positive voltage, open circuit between #1 and #2 (switch open) l when Gate has zero voltage, short circuit between #1 and #2 (switch closed) Gate = 1 Inverter (NOT Gate) Truth table In Out In Out Gate = 0 0 V 2.9 V 2.9 V 0 V Terminal #1 must be connected to +2.9V. 2
3 NOR Gate OR Gate A B C Note: Serial structure on top, parallel on bottom. A B C Add inverter to NOR. NAND Gate (NOT(AND)) AND Gate A B C Note: Parallel structure on top, serial on bottom. A B C Add inverter to NAND. 3
4 Basic Logic Gates Symbols XOR: truth table A^B A B A XOR B + XOR A O + B   A^B= A & B + A&B DeMorgan's Law l NOT (A and B) = NOT (A) OR NOT (B) l NOT (A OR B) = NOT(A) AND NOT (B) A BB NOT(A AND B) NOT (A) NOT (B) NOT(A) OR NOT(B) DeMorgan's Law l Converting AND to OR (with some help from NOT) l Consider the following gate: To convert AND to OR (or vice versa), invert inputs and output. A B A B A B A B Same as A OR B 4
5 More than 2 Inputs? l AND/OR can take any number of inputs. l AND = 1 if all inputs are 1. l OR = 1 if any input is 1. l Similar for NAND/NOR. l Can implement with multiple twoinput gates, or with single CMOS circuit. Building Functions from Logic Gates l Combinational Logic Circuit l output depends only on the current inputs l stateless l Sequential Logic Circuit l output depends on the sequence of inputs (past and present) l stores information (state) from past inputs l We'll first look at some useful combinational circuits, then show how to use sequential circuits to store information. Half adder l A half adder is used to add just two bits. l The result consists of two bits: a sum (the right bit) and a carry out (the left bit) S l Here is the circuit and its block symbol X Y CS = = = = 10 C Full Adder l Add two bits and carryin, produce onebit sum and carryout. A B C in S C out
6 Fourbit Adder (carryripple adder) Carry Save adder l Compute Sum and Carry independently l l l l Disadvantage: Delay through N1 Stages l Then add S + C 000 l 101 l l 1010 Carry Save adder l Delay reduced compared to Carry ripple adder l Add 3 Numbers and Produce two numbers S and C X: Y: Z: C: l Final result is S + shifted carry X: Y: Z: S: C: Sum: X: Y: Z: S: Carry Save Adder Design X Y Z CSA n+1 n C=carry S=sum + X X n1 Y n1 Z n1 n2 Y n2 X Z n2 0 Y 0 Z 0 FA FA FA C n S C n1 C 1 n1 S n2 S 0 N Bit Carry Save Adder Block C 0 =0 6
7 Decoder l n inputs, 2 n outputs l exactly one output is 1 for each possible input pattern Decoder l n inputs, 2 n outputs l exactly one output is 1 for each 0 possible input pattern 2bit decoder 2bit decoder Selecting Memory Multiplexer (MUX) A0.. A7 256 x 8 RAM 256 x 8 RAM 256 x 8 RAM 256 x 8 RAM l nbit selector and 2 n inputs, one output l output equals one of the inputs, depending on selector A8 A9 2 to 4 decoder 4to1 MUX 7
8 Circuit Design Converting Truth Table to Boolean Expression l Designing circuits is a process 1. Have a good idea. What kind of circuit might be useful? 2. Derive a truth table for this circuit. 3. Derive a Boolean expression for the truth table. 4. Build a circuit given the Boolean expression l l Building the circuit involves mapping the Boolean expression to actual gates. This part is easy. Deriving the Boolean expression is easy. Deriving a good one is tricky. l Given a circuit, isolate that rows in which the output of the circuit should be true. Converting Truth Table to Boolean Expression Converting Truth Table to Boolean Expression l Given a circuit, isolate that rows in which the output of the circuit should be true. l A product term that contains exactly one instance of every variable is called a minterm. l Given the expressions for each row, build a larger Boolean expression for the entire table. l This is a sumofproducts (SOP) form. 8
9 Converting Truth Table to Boolean Expression First Approach: Algebraic l Simply use the rules of Boolean logic l Finally build the circuit. l Problem: SOP forms are often not minimal. l Solution: Make it minimal. We ll go over two ways. The Result Karnaugh Maps or KMaps l Kmaps are a graphical technique to view minterms and how they relate. l The map is a diagram made up of squares, with each square representing a single minterm. l Minterms resulting in a 1 are marked as 1, all others are marked 0 9
10 2 Variable KMap 2 Variable KMap 2 Variable KMap Finding Commonality
11 Finding the best solution Simplify Example l Grouping become simplified products. l Both are correct. A+B is preferred. Simplify Example 3 Variable KMaps C l Note in higher maps, several variables occupy a given axis l The sequence of 1s and 0s follow a Gray Code Sequence. B 11
12 3 Variable KMaps 3 Variable KMaps C B 3 Variable KMaps 3 Variable KMaps 12
13 3 Variable KMaps Back to our earlier example.. l The Kmap and the algebraic produce the same result. Up up and let s D keep going Few more examples D A C B A B C 13
14 Few more examples D A B C 14
! Logically, each transistor acts as a switch! Combined to implement logic functions (gates) n AND, OR, NOT
Computing Layers Chapter 3 Digital Logic Structures Problems Algorithms Language Instruction Set Architecture Microarchitecture Original slides from Gregory Byrd, North Carolina State University Modified
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 informationBasics of Digital Logic Design
CSE 675.2: Introduction to Computer Architecture Basics of Digital Logic Design Presentation D Study: B., B2, B.3 Slides by Gojko Babi From transistors to chips Chips from the bottom up: Basic building
More informationA Little Perspective Combinational Logic Circuits
A Little Perspective Combinational Logic Circuits COMP 251 Computer Organization and Architecture Fall 2009 Motivating Example Recall our machine s architecture: A Simple ALU Consider an ALU that can perform
More informationDesign with Multiplexers
Design with Multiplexers Consider the following design, taken from the 5 th edition of my textbook. This is a correct implementation of the Carry Out of a Full Adder. In terms of Boolean expressions, this
More informationDigital 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
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 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 informationDigital Logic Design. Basics Combinational Circuits Sequential Circuits. PuJen Cheng
Digital Logic Design Basics Combinational Circuits Sequential Circuits PuJen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Combinational Logic Martha A. Kim Columbia University Fall 23 / Combinational Circuits Combinational circuits are stateless. Their output is a function only of the current
More informationExclusive OR/Exclusive NOR (XOR/XNOR)
Exclusive OR/Exclusive NOR (XOR/XNOR) XOR and XNOR are useful logic functions. Both have two or more inputs. The truth table for two inputs is shown at right. a XOR b = 1 if and only if (iff) a b. a XNOR
More informationChapter 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
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 informationCounters and Registers. Dr. Anurag Srivastava
Counters and Registers Dr. Anurag Srivastava 1 Basic of digital design Basic gates (AND,OR, NOR, NAND and INVERTER) Universal gates (NAND and NOR) Design of any function using basic gates F=xy+(xyz+zx+xz)xy
More informationCombinational Logic Building Blocks and Bus Structure
Combinational Logic Building Blocks and Bus Structure ECE 5A Winter 0 Reading Assignment Brown and Vranesic Implementation Technology.8 Practical Aspects.8.7 Passing s and 0s Through Transistor Switches.8.8
More informationTutorial 5 Special Combinational Logic Circuit
Tutorial 5 Special Combinational Logic Circuit Question 1 a) What is the function of an adder circuit? b) A halfadder adds two binary bits, true or false? c) A halfadder has a sum output only, true or
More informationComputer Systems Lab 1. Basic Logic Gates
Computer Systems Lab Basic Logic Gates Object To investigate the properties of the various types of logic gates, and construct some useful combinations of these gates. Parts () 700 Quad input NAND gate
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 5. Combinational & Sequential Circuits
SAMPLE OF THE STUD MATERIAL PART OF CHAPTER 5 5. Introduction Digital circuits can be classified into two types: Combinational digital circuits and Sequential digital circuits. 5.2 Combinational Digital
More informationSwitches and Transistors
Switches and Transistors CS 350: Computer Organization & Assembler Language Programming A. Why? It s natural to use on/off switches with voltages representing binary data. Transistor circuits act as switches.
More informationIntroduction to Logic Design with VHDL
EECE 379 : DESIGN OF DIGITAL AND MICROCOMPUTER SYSTEMS 2000/2001 WINTER SESSION, TERM 1 Introduction to Logic Design with VHDL This chapter reviews the design of combinational and sequential logic and
More informationChapter 4 Combinational Logic
Chapter 4 Combinational Logic ChihTsun Huang ( 黃稚存 ) Department of Computer Science National Tsing Hua University Outline Introduction Combinational Circuits Analysis Procedure Design Procedure Binary
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 informationChapter 3: Combinational Logic Design
Chapter 3: Combinational Logic Design 1 Introduction We have learned all the prerequisite material: Truth tables and Boolean expressions describe functions Expressions can be converted into hardware circuits
More informationComputer Organization I. Lecture 8: Boolean Algebra and Circuit Optimization
Computer Organization I Lecture 8: Boolean Algebra and Circuit Optimization Overview The simplification from SOM to SOP and their circuit implementation Basics of Logic Circuit Optimization: Cost Criteria
More informationExperiment 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
More informationWEEK 2.2 CANONICAL FORMS
WEEK 2.2 CANONICAL FORMS 1 Canonical SumofProducts (SOP) Given a truth table, we can ALWAYS write a logic expression for the function by taking the OR of the minterms for which the function is a 1. This
More informationThe equation for the 3input XOR gate is derived as follows
The equation for the 3input XOR gate is derived as follows The last four product terms in the above derivation are the four 1minterms in the 3input XOR truth table. For 3 or more inputs, the XOR gate
More information1.10 (a) Effects of logic gates AND, OR, NOT on binary signals in a processor
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
More informationGates, Circuits and Boolean Functions
Lecture 2 Gates, Circuits and Boolean Functions DOC 112: Hardware Lecture 2 Slide 1 In this lecture we will: Introduce an electronic representation of Boolean operators called digital gates. Define a schematic
More informationReview of Gates in Digital Electronics
pp. 2226 Krishi Sanskriti Publications http://www.krishisanskriti.org/areee.html Review of Gates in Digital Electronics Divya Aggarwal Student, Department of Physics, University of Delhi Abstract: Digital
More informationKarnaugh Maps. Circuitwise, this leads to a minimal twolevel 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 informationDigital Circuits. Frequently Asked Questions
Digital Circuits Frequently Asked Questions Module 1: Digital & Analog Signals 1. What is a signal? Signals carry information and are defined as any physical quantity that varies with time, space, or any
More informationGates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction
Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and
More information4.203 Write the truth table for each of the following logic functions:
3e4.5 4.201 According to DeMorgan s theorem, the complement of X + Y Z is X Y +Z. Yet both functions are 1 for XYZ = 110. How can both a function and its complement be 1 for the same input combination?
More informationCombinational circuits
Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (Highlevel view)
More informationLogic gate implementation and circuit minimization
Logic gate implementation and circuit minimization Lila Kari The University of Western Ontario Logic gate implementation and circuit minimization CS2209, Applied Logic for Computer Science 1 / 48 Why binary?
More informationBasic CMOS concepts. Computer Design and Technology Assignment 2
Basic CMOS concepts We will now see the use of transistor for designing logic gates. Further down in the course we will use the same transistors to design other blocks (such as flipflops or memories)
More information4 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.
More informationLecture 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
More informationLOGIC DESIGN LABORATORY MANUAL
LOGIC DESIGN LABORATORY MANUAL Logic Design Laboratory Manual 1 EXPERIMENT: 1 LOGIC GATES AIM: To study and verify the truth table of logic gates LEARNING OBJECTIVE: Identify various ICs and their specification.
More informationCOMBINATIONAL LOGIC CIRCUITS
COMBINATIONAL LOGIC CIRCUITS 4.1 INTRODUCTION The digital system consists of two types of circuits, namely: (i) Combinational circuits and (ii) Sequential circuits A combinational circuit consists of logic
More information28. Minimize the following using Tabular method. f(a, b, c, d, e)= m(0,1,9,15,24,29,30) + d(8,11,31) 29. Minimize the following using Kmap method.
Unit1 1. Show Karnaugh map for equation Y = F(A,B,C) = S m(1, 2, 3, 6, 7) 2. Show Karnaugh map for equation Y = F(A,B,C,D) = S m(1, 2, 3, 6, 8, 9, 10, 12, 13, 14) 3. Give SOP form of Y = F(A,B,C,D) =
More informationEE 110 Practice Problems for Exam 2: Solutions, Fall 2008
EE 110 Practice Problems for Exam 2: Solutions, Fall 2008 1. Circle T (true) or F (false) for each of these Boolean equations. (a). T FO An 8to1 multiplexer requires 2 select lines. (An 8to1 multiplexer
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 informationVALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK SUBJECT CODE/NAME YEAR/ SEMESTER : EC6302/ DIGITAL ELECTRONICS : II
More information1. Digital Logic Circuits
1 Digital Logic ircuits 1. Digital Logic ircuits Many scientific, industrial and commercial advances have been made possible by the advent of computers. Digital Logic ircuits form the basis of any digital
More informationComp 150 Booleans and Digital Logic
Comp 150 Booleans and Digital Logic Recall the bool date type in Python has the two literals True and False and the three operations: not, and, or. The operations are defined by truth tables (see page
More information6. Combinational Circuits. Building Blocks. Digital Circuits. Wires. Q. What is a digital system? A. Digital: signals are 0 or 1.
Digital Circuits 6 Combinational Circuits Q What is a digital system? A Digital: signals are or analog: signals vary continuously Q Why digital systems? A Accurate, reliable, fast, cheap Basic abstractions
More informationPoints Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 5: Logic Simplication & Karnaugh Map
Points Addressed in this Lecture Lecture 5: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London (Floyd 4.54.) (Tocci 4.4.5) Standard form of Boolean Expressions
More informationChapter 4. Combinational Logic. Outline. ! Combinational Circuits. ! Analysis and Design Procedures. ! Binary Adders. ! Other Arithmetic Circuits
Chapter 4 Combinational Logic 4 Outline! Combinational Circuits! Analysis and Design Procedures! Binary Adders! Other Arithmetic Circuits! Decoders and Encoders! Multiplexers 42 Combinational v.s Sequential
More informationLecture #5 Basics of Digital Logic Design
Spring 2015 Benha University Faculty of Engineering at Shoubra ECE291 Electronic Engineering Lecture #5 Basics of Digital Logic Design Instructor: Dr. Ahmad ElBanna 1 Agenda Basic Concepts Logic Gates
More informationLAB 2: BOOLEAN THEOREMS
LAB 2: BOOLEAN THEOREMS OBJECTIVES 1. To implement DeMorgan's theorems in circuit simplification. 2. To design a combinational logic circuit with simplest logic gates representation using Karnaugh Mapping
More informationChapter 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
More informationLab 1: Introduction to Combinational Design
Lab : Introduction to Combinational Design. Introduction The purpose of this experiment is to introduce you to the basics of logic gates, positive/negative logic and gate behavior. In this lab, you will
More informationArithmeticlogic units
Arithmeticlogic units An arithmeticlogic unit, or ALU, performs many different arithmetic and logic operations. The ALU is the heart of a processor you could say that everything else in the CPU is there
More informationComputer Science. 19. Combinational Circuits. Computer Science. Building blocks Boolean algebra Digital circuits Adder circuit. Arithmetic/logic unit
PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science 9. Combinational Circuits Computer Science 9.
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationTwolevel logic using NAND gates
CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Twolevel logic using NND gates Replace minterm ND gates with NND gates Place
More informationECE 109 Spring Launch Logisim by opening a terminal window and entering the command:
Problem Session 3 Overview Welcome to Logisim! Logisim is a logic simulator that allows you design and simulate digital circuit using a graphical user interface. It was written by Carl Burch. Logisim comes
More information(Refer Slide Time: 1:48)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture  29 Multiplexer Based Design (Refer Slide Time: 1:48) Yesterday we
More informationELG3331: Lab 3 Digital Logic Circuits
ELG3331: Lab 3 Digital Logic Circuits What does Digital Means? Digital describes any system based on discontinuous data or events. Typically digital is computer data or electronic sampling of an analog
More informationDIGITAL SYSTEM DESIGN LAB
EXPERIMENT NO: 7 STUDY OF FLIP FLOPS USING GATES AND IC S AIM: To verify various flipflops like D, T, and JK. APPARATUS REQUIRED: Power supply, Digital Trainer kit, Connecting wires, Patch Chords, IC
More informationGates and Logic: From switches to Transistors, Logic Gates and Logic Circuits
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See: P&H ppendix C.2 and C.3 (lso, see C.0 and
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 informationCombinational logic lab
ECE2883 HP: Lab 3 Logic Experts (LEs) Combinational logic lab Implementing combinational logic with Quartus We should be starting to realize that you, the SMEs in this course, are just a specific type
More informationExamples of Solved Problems for Chapter3,5,6,7,and8
Chapter 3 Examples of Solved Problems for Chapter3,5,6,7,and8 This document presents some typical problems that the student may encounter, and shows how such problems can be solved. Note that the numbering
More informationUNIT I NUMBER SYSTEM AND BINARY CODES
1 UNIT I NUMBER SYSTEM AND BINARY CODES 1.0 Aims and Objectives 1.1 Introduction 1.2 Number System 1.2.1 Decimal Number System 1.2.2 Bistable Devices 1.2.3 Binary Number System 1.2.4 Octal number System
More informationChapter 02 Logic Design with MOSFETs
Introduction to VLSI Circuits and Systems 路 論 Chapter 02 Logic Design with MOSFETs Dept. of Electronic Engineering National ChinYi University of Technology Fall 2007 Outline The Fundamental MOSFETs Ideal
More informationChapter 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
More informationDigital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell
Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates
More informationFinal Exam review: chapter 4 and 5. Supplement 3 and 4
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flipflop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationDEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING Lab Manual Digital Electronics Laboratory (EC39) BACHELOR OF TECHNOLOGY Subject Code: EC 39 Subject Name: Digital Electronics Laboratory Teaching
More informationDigital Logic Circuits
Digital Logic Circuits Digital describes any system based on discontinuous data or events. Typically digital is computer data or electronic sampling of an analog signal. Computers are digital machines
More informationModule 3 Digital Gates and Combinational Logic
Introduction to Digital Electronics, Module 3: Digital Gates and Combinational Logic 1 Module 3 Digital Gates and Combinational Logic INTRODUCTION: The principles behind digital electronics were developed
More informationKarnaugh Map. Alternative way to Boolean Function Simplification. Karnaugh Map. Description of Kmap & Terminology
Alternative way to Boolean Function Simplification Karnaugh Map CIT 595 Spring 2010 Simplification of Boolean functions leads to simpler (and usually faster) digital circuits Simplifying Boolean functions
More information1. 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
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 (twoelement switching algebra
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 informationReading and construction of logic gates
Reading and construction of logic gates A Boolean function is an expression formed with binary variables, a binary variable can take a value of 1 or 0. Boolean function may be represented as an algebraic
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 informationIntroduction. 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
More informationRita Lovassy. Digital Technics
Rita Lovassy Digital Technics Kandó Kálmán Faculty of Electrical Engineering Óbuda University Budapest, 2013 Preface Digital circuits address the growing need for computer networking communications in
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.32.5) Standard Forms ProductofSums (PoS) SumofProducts (SoP) converting between Minterms
More informationChapter 4 Combinational Logic
EEA051  Digital Logic 數位邏輯 Chapter 4 Combinational Logic 吳俊興國立高雄大學資訊工程學系 November 2005 Chapter 4 Combinational Logic 41 Combinational Circuits 42 Analysis Procedure 43 Design Procedure 44 Binary AdderSubtractor
More informationCOMBINATIONAL CIRCUITS
COMBINATIONAL CIRCUITS http://www.tutorialspoint.com/computer_logical_organization/combinational_circuits.htm Copyright tutorialspoint.com Combinational circuit is a circuit in which we combine the different
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 informationEE360: Digital Design I Course Syllabus
: Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential
More information4.0 Design of Synchronous Counters
4.0 Design of Synchronous Counters This section begins our study of designing an important class of clocked sequential logic circuitssynchronous finitestate machines. Like all sequential circuits, a
More informationGateLevel Minimization
Chapter 3 GateLevel Minimization 3 Outline! Karnaugh Map Method! NAND and NOR Implementations! Other TwoLevel Implementations! ExclusiveOR Function! Hardware Description Language 32 Why Logic Minimization?!
More informationCombinational Logic Tutorial sheet
Combinational Logic Tutorial sheet 1) Redraw the following circuits into the respective ANSI symbols a. b. c. d. 2) Write the Boolean equation for each of the circuit diagrams in question 1. 3) Convert
More informationLecture 9: FlipFlops, Registers, and Counters
Lecture 9: FlipFlops, Registers, and Counters 1. T FlipFlops toggles its output on a rising edge, and otherwise keeps its present state. 1.1. Since the toggle from high to low to high takes two clock
More informationCombinational 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
More informationREGISTERS. Consists of a set of flipflops (each flipflop stores one bit of information)
REGISTERS Sequential circuit used to store binary word Consists of a set of flipflops (each flipflop stores one bit of information) External gates may be used to control the inputs of the flipflops:
More informationChapter 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
More informationIntroduction. Digital Logic Design 1. Simplifying Logic Circuits. SumofProducts Form. Algebraic Simplification
2007 Introduction BK TP.HCM Tran Ngoc Thinh HCMC University of Technology http://www.cse.hcmut.edu.vn/~tnthinh Basic logic gate functions will be combined in combinational logic circuits. Simplification
More informationECE 331 Digital System Design
ECE 331 Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #21) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
More informationRAM & 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
More informationDigital Logic Design CSE241
Digital Logic Design CSE241 Unit 20 3Bit Synchronous Binary Counter: 2 1 4Bit Synchronous Binary Counter: 3 DOWN COUNTERS: A synchronous counter that counts in the reverse or downward sequence can be
More informationReview of ECE 230 Material Prof. A. Mason, Michigan State University
Review of ECE 230 Material Prof. A. Mason, Michigan State University Preface This document was developed for students taking ECE 331 to review material covered in ECE 230. It will be assumed that ECE 331
More informationRUTGERS UNIVERSITY Department of Electrical and Computer Engineering 14:332:233 DIGITAL LOGIC DESIGN LABORATORY
RUTGERS UNIVERSITY Department of Electrical and Computer Engineering 14:332:233 DIGITAL LOGIC DESIGN LABORATORY Fall 2012 Contents 1 LABORATORY No 1 3 11 Equipment 3 12 Protoboard 4 13 The InputControl/OutputDisplay
More information