Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.

Slides:



Advertisements
Similar presentations
Digital Logical Structures
Advertisements

Modular Combinational Logic
Cs 1110 Ch 4-1 Combinational Logic. ° Introduction Logic circuits for digital systems may be: °2°2 combinational sequential OR A combinational circuit.
Combinational Circuits
التصميم المنطقي Second Course
Chapter 1 — Computer Abstractions and Technology — 1 Lecture 7 Carry look ahead adders, Latches, Flip-flops, registers, multiplexors, decoders Digital.
Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Sequential Logic Flip Flops Registers Memory Timing State Machines.
Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.
Overview Recall Combinational Logic Sequential Logic Storage Devices
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.
11/16/2004EE 42 fall 2004 lecture 331 Lecture #33: Some example circuits Last lecture: –Edge triggers –Registers This lecture: –Example circuits –shift.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Chapter 7 Arithmetic Operations and Circuits Hexadecimal Arithmetic 4 binary bits represent a single hexadecimal digit Addition –Add the digits.
Computer Science 210 s1 Computer Systems Semester 1 Lecture Notes James Goodman (revised by Robert Sheehan) Credits: Slides prepared by Gregory.
Chapter 12 Digital Logic Circuit Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Logic Gates Combinational Circuits
Building Adders & Sub tractors Dr Ahmed Telba. Introducing adder circuits Adder circuits are essential inside microprocessors as part of the ALU, or arithmetic.
CS 105 Digital Logic Design
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Combinational and Sequential Logic Circuits.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
1 Modified from  Modified from 1998 Morgan Kaufmann Publishers Chapter Three: Arithmetic for Computers citation and following credit line is included:
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Basic Logic Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.
Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:
Chapter 3 Digital Logic Structures
PART 3 Digital Logic 1.Logic Gates 2.Logic Circuits 3.Memory 4.Sequential Circuits 5.LC-3 Data Path.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Introduction to Computer Engineering CS/ECE 252, Spring 2012 Prof. Karu Sankaralingam Computer Sciences Department University of Wisconsin – Madison.
Instructor:Po-Yu Kuo 教師:郭柏佑
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 7 Dr. Shi Dept. of Electrical and Computer Engineering.
Introduction to Computer Engineering CS/ECE 252, Fall 2007 Prof. David A. Wood Computer Sciences Department University of Wisconsin – Madison.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Complex Combinational Logic Blocks ECE/CS 252, Fall 2010 Prof.
1 Fundamentals of Computer Science Combinational Circuits.
Instructor : Po-Yu Kuo 教師:郭柏佑 Ch. 3 Digital Logic Structures EL 1009 計算機概論 ( 電子一 B) Introduction to Computer Science.
Introduction to Computing Systems and Programming Digital Logic Structures.
Chapter 3 Digital Logic Structures
Latches, Flip Flops, and Memory ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Explain Half Adder and Full Adder with Truth Table.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Digital Logic Structures. Transistor: The Digital Building Block Microprocessors contain LOTS of transistors –Intel Pentium 4 (2000): 48 million –IBM.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Instructor:Po-Yu Kuo 教師:郭柏佑
Combinational Circuits
ECE 3130 Digital Electronics and Design
Instructor:Po-Yu Kuo 教師:郭柏佑
Week 7: Gates and Circuits: PART II
Instructor:Po-Yu Kuo 教師:郭柏佑
Digital Logic.
Digital Logic.
Combinational Circuits
Combinational Circuits
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
Presentation transcript:

Chapter 3 Digital Logic Structures

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions from Logic Gates We've already seen how to implement truth tables using AND, OR, and NOT -- an example of combinational logic. Combinational Logic Circuit output depends only on the current inputs stateless Sequential Logic Circuit output depends on the sequence of inputs (past and present) stores information (state) from past inputs We'll first look at some useful combinational circuits, then show how to use sequential circuits to store information.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Full Adder 3-3 Consider computing 7+6=13: Now, consider one column of this addition: A combinational logic design

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-bit Full Adder 3-4 Truth table for a 1-bit adder: Formulate a circuit for each output

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. The Majority Circuit for CarryOut 3-5

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Odd-Parity Circuit for the Sum 3-6

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-7 Putting It All Together: Full Adder Add two bits and carry-in, produce one-bit sum and carry-out. ABC in SC out

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-8 Four-bit Adder

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Multiplexer (MUX) A device with multiple inputs and 1 output Could be used to allocate a resource to one of multiple clients: 3-9

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. MUX A 2 n -to-1 multiplexer (MUX) sends one of 2 n input lines to a single output line A MUX has two sets of inputs: 2 n data input lines n select lines used to pick one of the 2 n data inputs Simplest example is a 2-to-1 MUX 3-10

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-to-1 MUX 3-11

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Multiplexer (MUX) n-bit selector and 2 n inputs, one output output equals one of the inputs, depending on selector 4-to-1 MUX

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-to-1 MUX from Two 2-to-1 MUXs 3-13 S0 S1

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Decoder General example: Assume that some information is encoded in n bits For each encoding, we want to activate the (one) correct output line The general idea: given an n-bit input Detect which of the 2 n combinations is represented Produce 2 n output, only one of which is “1” A n-to-2 n decoder takes an n-bit input and produces 2 n outputs. The n inputs represent a binary number that determines which one of the 2 n outputs is “true” (i.e., 1). 3-14

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-to4 Decoder 3-15 This circuit decodes a binary input into one of four possible choices, or codes

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Decoder n inputs, 2 n outputs exactly one output is 1 for each possible input pattern 2-bit decoder

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Representing Multi-bit Values Number bits from right (0) to left (n-1) just a convention -- could be left to right, but must be consistent Use brackets to denote range: D[l:r] denotes bit l to bit r, from left to right May also see A, especially in hardware block diagrams. A = A[2:0] = 101 A[14:9] =

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Multibit Values in Circuit Diagrams A 4-to-1 mux, selecting one byte out of a 32-bit value

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. MUX example -- what does this circuit do? 3-19

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex: adder always generates sum and carry, regardless of previous inputs Sequential Circuit stores information output depends on stored information (state) plus input  so a given input might produce different outputs, depending on the stored information example: ticket counter  advances when you push the button  output depends on previous state useful for building “memory” elements and “state machines”