EE292: Fundamentals of ECE

Similar documents
1. Convert the decimal number to binary, octal, and hexadecimal.

CHAPTER 4: Logic Circuits

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

CHAPTER 4: Logic Circuits

Digital Circuit And Logic Design I. Lecture 8

Digital Circuit And Logic Design I

Chapter 4. Logic Design

MC9211 Computer Organization

Lecture 8: Sequential Logic

CPS311 Lecture: Sequential Circuits

Final Exam review: chapter 4 and 5. Supplement 3 and 4

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

Sequential Logic Circuits

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

Logic. Andrew Mark Allen March 4, 2012

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

RS flip-flop using NOR gate

UNIT IV. Sequential circuit

REPEAT EXAMINATIONS 2002

Chapter. Synchronous Sequential Circuits

Introduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1

SEMESTER ONE EXAMINATIONS 2002

Chapter 5 Synchronous Sequential Logic

Chapter 5 Sequential Circuits

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

RS flip-flop using NOR gate

FE REVIEW LOGIC. The AND gate. The OR gate A B AB A B A B 0 1 1

MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100

Chapter 8 Sequential Circuits

Other Flip-Flops. Lecture 27 1

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram

Asynchronous (Ripple) Counters

Chapter 5: Synchronous Sequential Logic

10.1 Sequential logic circuits are a type of logic circuit where the output of the circuit depends not only on

Department of CSIT. Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

MODULE 3. Combinational & Sequential logic

Experiment 8 Introduction to Latches and Flip-Flops and registers

Computer Architecture and Organization

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

Sequential Digital Design. Laboratory Manual. Experiment #3. Flip Flop Storage Elements

Vignana Bharathi Institute of Technology UNIT 4 DLD

A Review of logic design

Part 4: Introduction to Sequential Logic. Basic Sequential structure. Positive-edge-triggered D flip-flop. Flip-flops classified by inputs

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

Chapter 6 Digital Circuit 6-5 Department of Mechanical Engineering

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 151) Pass Marks: 24

Unit 11. Latches and Flip-Flops

Introduction to Microprocessor & Digital Logic

INTRODUCTION TO SEQUENTIAL CIRCUITS

Flip-Flops and Sequential Circuit Design

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

THE KENYA POLYTECHNIC

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M

Chapter 3. Boolean Algebra and Digital Logic

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Sri Vidya College of Engineering And Technology. Virudhunagar Department of Electrical and Electronics Engineering

Logic Design. Flip Flops, Registers and Counters

DIGITAL CIRCUIT COMBINATORIAL LOGIC

Digital Logic Design Sequential Circuits. Dr. Basem ElHalawany

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS

Sequential Logic Basics

`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

Counter dan Register

Section 6.8 Synthesis of Sequential Logic Page 1 of 8

DIGITAL ELECTRONICS MCQs

ELCT201: DIGITAL LOGIC DESIGN

COSC 243. Sequential Logic. COSC 243 (Computer Architecture) Lecture 5 - Sequential Logic 1

Slide 1. Flip-Flops. Cross-NOR SR flip-flop S R Q Q. hold reset set not used. Cross-NAND SR flip-flop S R Q Q. not used reset set hold 1 Q.

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

D Latch (Transparent Latch)

UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.

Combinational vs Sequential

Digital Circuits ECS 371

ME 515 Mechatronics. Introduction to Digital Electronics

CHAPTER1: Digital Logic Circuits

Sequential Logic and Clocked Circuits

SEQUENTIAL LOGIC. Satish Chandra Assistant Professor Department of Physics P P N College, Kanpur

Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012

FLIP-FLOPS AND RELATED DEVICES

Department of Computer Science and Engineering Question Bank- Even Semester:

Sequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1

EET2411 DIGITAL ELECTRONICS

Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,

ELCT201: DIGITAL LOGIC DESIGN

Synchronous Sequential Logic

UNIT-3: SEQUENTIAL LOGIC CIRCUITS

Digital Logic Design ENEE x. Lecture 19

AC103/AT103 ANALOG & DIGITAL ELECTRONICS JUN 2015

Introduction to Digital Electronics

Synchronous sequential circuits

Introduction to Sequential Circuits

COE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

LATCHES & FLIP-FLOP. Chapter 7

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

0 0/1 0/1 0/1 0/1 0/1 0/1 0/1 0/1 1 1 Stop bits. 11-bit Serial Data format

DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS)

B.Tech CSE Sem. 3 15CS202 DIGITAL SYSTEM DESIGN (Regulations 2015) UNIT -IV

Transcription:

EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 23 121120 http://www.ee.unlv.edu/~b1morris/ee292/

2 Outline Review Combinatorial Logic Sequential Logic

3 Combinatorial Logic Circuits Combine logical variable inputs to produce a logic-variable output Logic can be specified by enumerating the output for all possible input combinations in a truth table Considered memoryless circuits The output at a given time instant are only dependent on the input at the same time instant

4 Basic Logic Gates Inverter NOT operation or complement of a variable NOT(A) = A AND - computes the logical multiplication of input variables AND(A, B) = AB OR - computes the logical addition of input variables OR A, B = A + B

5 More Logic Gates In silicon chips, other gates are simpler to implement Buffer = NOT followed by NOT Returns the same value NAND = AND followed by NOT NOR = OR followed by NOT XOR is the exclusive-or gate XOR A, B = A B A B A B 0 0 0 0 1 1 1 0 1 1 1 0

6 Boolean Algebra Mathematical theory of logical variables Use basic AND, OR, and NOT relationships to prove a Boolean expression Can generate a truth table to specify the output relationship for all possible input values De Morgan s Laws Provides a way to convert an AND relationship into an OR relationship and vice versa ABC = A + B + C A + B + C = A BC

7 Implementation of Boolean Expressions A logical variable can be composed of Boolean relationships AND, OR, NOT, etc. Gate level implementation is straightforward Example F = ABC + ABC + (C + D)(D + E)

8 Simplifying Boolean Expression Find simpler equivalent expressions by manipulation of equation and Boolean relations Example F = ABC + ABC + (C + D)(D + E) F = ABC + ABC + CD + CE + DD + DE F = ABC + ABC + CD + CE + 0 + DE F = AC B + B + CD + CE + 0 + DE F = AC 1 + CD + CE + 0 + DE F = C A + D + E + DE

9 Synthesis of Logic Require methods to convert logic circuit specifications into a practical gate level implementation Often the logic is specified in a natural language Example: automatic windshield wipers When it is raining (input 1) and cloudy (input 2) the wipers should be on (output) Example: 3 Logical variable input and 1 output Enumerate all possible input values and specify the corresponding output A, B, C input and D output A B C D 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1

10 Sum-of-Products Implementation Find all output rows that have a 1 output Determine AND relationship between inputs OR the AND terms from each row A B C D AND Term 0 0 0 1 A BC 0 0 1 0 0 1 0 1 A BC 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 ABC 1 1 1 1 ABC D = A BC + A BC + ABC + ABC

11 Product-of-Sums Implementation Find all output rows that have a 0 output Determine OR relationship between inputs AND the OR terms from each row A B C D OR Term 0 0 0 1 0 0 1 0 A + B + C 0 1 0 1 0 1 1 0 A + B + C 1 0 0 0 A + B + C 1 0 1 0 A + B + C 1 1 0 1 1 1 1 1 D = (A + B + C )(A + B + C )(A + B + C)(A + B + C )

12 Sequential Logic Combinatorial logic output is only dependent on input at the given time Sequential logic has outputs that are dependent not only on current input but past input as well The circuits have memory Often times sequential circuits use a clock signal to regulate when the output should change These are called synchronous circuits Asynchronous circuits are able to change as soon as inputs change (no clock signal is required)

13 The Flip-Flop This is the basic building block for sequential circuits A flip-flop has two allowable states of operation It is able to store a bit of information When Q is high Q will be low When Q is low Q will be high Coupled inverter configuration ensures the state does not change Once Q is set, it does not change How can we set the flip-flop state?

14 SR Flip-Flops Set-reset (SR) flip-flop allows control of the state When R and S are low This behaves as the coupled inverters Remains in set state (Q set stays high) When S is high and R is low Top NOR is an inverter and Q is forced high and Q low When R is high and S is low Bottom NOR is an inverter and Q is forced high and Q is low R and S cannot both be set at the same time

15 SR Flip-Flop Truth Table S = Set R = Reset Truth Table The circuit remember what was the last input Q n - represents the output at a time n Q n 1 - represents the output at an earlier time n 1 Time n 1 is the time when either S or R was last high Notice that set and reset inputs are not allowed to be high at the same time Circuit cannot operate in this condition

16 Debouncing a Switch Physical switches do not make perfect contact when moving from one position to another The voltage across the switch is said to bounce An SR flip-flop can be used to debounce the switch Make a good contact and prevent voltage from bounching Debounced output

17 Clocked SR Flip-Flop The previous SR flip-flop state changes as soon as either S or R is set Often we would like to have control on when the state is allowed to change Want a synchronous circuit Add a clock signal to the flipflop Only when the clock is high s the output allowed to change AND gates prevent R or S from reaching the flip-flop unless the clock C is high

18 Clocked SR with Asynchronous Input Clocked set and reset functionality with asynchronous set and reset as well Add OR gates at QQ outputs to automatically set or reset Notice that the clocked S and R cannot be high at the same time and neither can the asynchronous preset Pr and clear Cl

19 Edge-Triggered Circuits The clocked SR flip-flop uses the clock signal as an enable signal When the clock is high the circuit is allowed to change Edge-triggered circuits only respond at the time when the clock changes between low and high Positive-edge-triggered low to high transition Known as the leading edge Negative-edge-triggered high to low transition Known as the training edge

20 D Flip-Flop The delay (D) flip-flop is edge-triggered to take make the output the same as the input right before the clock transition The triangle by the clock signal C indicates it is positive-edge-triggered Up arrow in truth table indicates rising edge

21 Example: D Flip-Flop Positive-edge-triggered

22 JK Flip-Flop Similar operation to the SR flip-flop Except when J and K are both high, the output state Q will toggle Notice this is a negative-edge-triggered Triangle with a preceding invert bubble

23 Registers A flip-flop is able to store a single bit A register is an array of flip-flops used to store a digital word A hexadecimal number requires 4 bits so 4 flipflops are required to internally store the hex number http://enpub.fulton.asu.edu/cse517/lab3.html

24 Serial-In Parallel-Out Shift Register Serial-in implies bit are presented to the register one at a time (in a sequence) Parallel-out implies the contents of the register (all the bits) can be accessed at the same time

25 Serial-In Parallel-Out Operation Data is presented to a single input at the front of the word At each clock transition the data is shifted from one flipflop to the next After 4 clock cycles, the full word is available to be read in the register

26 Parallel-In Serial Out Shift Register Parallel data is provided as input and the output is serial data E.g. transmission of data on a telephone line The register can be cleared asynchronously to initialize the register Data is set on inputs and a parallel enable signal asynchronously loads the data The output is serially transmitted from the last flipflop stage

27 Counters Circuit used to count the pulses in an input signal Often the number of clocks are the signal of interest Inputs of JK flip-flop are tied together and high Causes the output state to toggle with each clock cycle Notice this is negative-edgetriggered Output of one JK flip-flop is the clock input of the next stage The word Q 2 Q 1 Q 0 is the binary representation of the count

28 Minimization of Logic Circuits We saw you can minimize logic variable representations using Boolean algebra but this can be tedious and prone to error The Karnaugh map (K-map) (Ch 7.5) is a principled method for determining the minimum representation This method is usually only practical for 4 variables (maybe 5 or 6) We will not cover this in class but it is an interesting read