CARLETON UNIVERSITY. Deparment of Electronics ELEC 2607 Switching Circuits January 19, Overview;

Size: px
Start display at page:

Download "CARLETON UNIVERSITY. Deparment of Electronics ELEC 2607 Switching Circuits January 19, Overview;"

Transcription

1 CARLETON UNIVERSITY Deparment of Electronics ELEC 267 Switching Circuits January 9, 24 Laboratory. Overview; A 4-Bit Binary Comparator Take a 4-bit binary number X, for example. This number is made of bits which we will call X 3 X 2 X X. Thus X 3 =, X 2 =, X =, X =. The full number is written in boldface, the individual bits are written with a subscript. A binary comparator compares two binary numbers nd Y. It can tell if X is larger, smaller, or equal to Y. The comparator in this lab will compare two 4-bit nonnegative binary numbers, and displays the result on two lights called Lx and Ly.. FIGURE : A block diagram of the circuit, showing the meanings of Lx and Ly, and some example comparisions X 3 X 2 X X COMPARAT Y 2 Y Y 4 DATA BITS LEAST SIGNIFC BIT LEAST SIGNIFC BIT Lx Ly Lx Ly X = Y X > Y X < Y never happens Examples X Y X 3 X 2 X X Y 2 Y Y Lx Ly This comparator is designed by breaking the circuit into subcircuits or blocks. Each block does a small part of the job. They can be made identical, which will save design work. Each subcircuit will compare two 2- bit numbers, say and Y a. The outputs will be two -bit numbers a and a.. FIGURE 2: Subcircuit or block Y a X 3 X 2 X X Y 2 Y Y COMP ba a a b Y ab = Y a > Y a < Y a Unused Output COMP 32 X 32 2 COMP 32 Lx Ly COMP X Y X 32 2 Complete block diagram to compare two 4-bit numbers. All three blocks can be made identical. However it turns out that COMP 32 can be made simpler than the other two. J.Knight, January 9, 4 SWITCHING CIRCUITS Lab -

2 J.Knight, January 9, 4 SWITCHING CIRCUITS Lab-2 These outputs have been carefully chosen so that the outputs of two comparators like COMP 32 and COMP, shown below, can be themselves compared with an identical subcircuit COMP 32. The output of this third block will be the desired output to lights Lx and Ly FIGURE 3: Examples:. X 3 = X 2 = = Y 2 = X = X = Y = Y = X 3 = X 2 = = Y 2 = X = X = Y = Y = COMP 32 X 32 = 2 = COMP X = Y = COMP 32 X 32 = 2 = COMP X = Y = COMP 32 X 32 = 2 = Lx Ly COMP 32 X 32 = 2 = Lx Ly Prelab This must be prepared prior to the scheduled lab session. It will be checked near the start of the lab. The prelab is the basis for the design part of the lab report. However it usually need considerable cleaning up and editing for the final report.. Complete the comparison algorithm, written like a computer program, for the generic subcircuit for the iterative comparator. Generic means for arbitrary inputs like and Y a rather than for specific inputs like X 2 X and Y 2 Y Y a Algorithm for one block of the comparator circuit. Inputs:, Y a, Outputs: a, a If ( > Y a ) Then a =; a If COMP ba a a.2 Complete the truth table, Fig. 4 (p. 3), for the generic comparator subcircuit, relating the inputs to the outputs. The inputs in the figure are in binary order. You may want to arrange them so the terms with no outputs are at the bottom., as shown in Fig. 5 (p. 3) Lab -2 SWITCHING CIRCUITS J.Knight, January 9, 24

3 FIGURE 4: Incomplete the truth table for the generic comparator subcircuit. COMP ba a a Ya b Y ab = Y a > Y a < Y a Unused Output inputs outputs Y a a a Boolean function to get a output for this particular line of inputs a a Comparison as 2-bit binary numbers. = Y a Y a < Y a Y a < Y a Y a < Y a Y a > Y a = Y a Y a < Y a Y a < Y a Find the logical equations relating,, Y a to a, a. To do this note for the partial table that a = for:,,, Y a =,,, or,,, or,,, or,,, or,,,... If,,, Y a =,,, then Y a = = If,,, Y a =,,, then Y a = = If,,, Y a =,,, then Y a = = If,,, Y a =,,, then Y a = = If,,, Y a =,,, then Y a = = With Boolean ( ) and (+) : a = Y a + Y a + Y a + Y a + Y a... () Complete the logic equation for the full truth table..4 Simplify the logic equation to reduce its size. For example,in partial expression (),the 2nd, 3rd, 4th and 5rd terms have two common variables, and. Considering only those four terms gives - Y a + Y a + Y a + Y a. = Y a + Y a + Y a + Y a = ( Y a + Y a + Y a + Y a ) = ( (Y a + Y a ) + (Y a + Y a )) (2) = you do the rest FIGURE 5: Rearrangement of part of Fig. 4 so the a = terms are all at the top and handy. inputs outputs Y a a a - Expression to generate a Y a Y a Y a Y a Y a Y a All other inputs J.Knight,January 9, 4 SWITCHING CIRCUITS Lab -3

4 J.Knight, January 9, 4 SWITCHING CIRCUITS Lab-4 Since X+X=X, one can reuse terms that were included in the previous reduction. Note the st and 3rd terms have two common letters. We need to include the st term in the final expression. The 3rd term can be reused - Y a + Y a = Y a ( + ) (3) FIGURE 6: = you do the rest Simplify the complete equations for a and a. a and a can be reduced to 6 letters each. Y a.5 From the equations one can draw a schematic diagram using, and INVERT gates. Fig. 6 shows the schematic for expression (2) ed with (3). Draw a schematic of a circuit to implement the complete equations for a and a. using, and INVERT gates..6 When drawing a theoretical circuit for a logic equation, one typically uses and gates. In practice, N and N gates are much easier to build. Thus real logic gets built with NS and Ns. On the Tektron logic board, used in the lab, the available gates are mostly Ns and Ns. The board contains only four 2-input s and four 2-input s. These are barely enough s and s for one comparator block. However you can easily implement your circuits using N gates, and perhaps N gates as described below. Use the diagram for the Tektron Logic Lab to complete the list of the number of gates of each type. Expression (2) ed with (3). This is only part of the circuit. for a. One way of implementing the complete circuit for a. It allows using a dual 2-input - gate. 2-input 3-input 2-input 2-input X 4 avaliable 3 avaliable 4 avaliable 4 avaliable 4 avaliable dual 2-input -N.7 There is a very important theorem, called DeMorgan s theorem ( Fig. 7) that will soon be done in the lectures. It proves that an N gate is equivalent to an gate with both its inputs inverted. The top of the following figure shows the two equivalent forms for N and for N. The lower part of Fig. 7 shows how to implement circuits made of operations followed by, using only N gates. Fig. 8 shows some more ways of using Ns and Ns instead of s and s....8 Revise the circuit for the generic comparator subcircuit using only gates which are plentiful in the Tektron Logic Lab. The same circuit is used for both of the COMP 32 and COMP blocks in Fig. 2. Be sure there are enough gates of the right types to build two subcircuits. The lower COMP 32 block will turns out to be simpler because it never gets some inputs. Lab -4 SWITCHING CIRCUITS J.Knight, January 9, 24

5 FIGURE 7: A B N C A B N C D E N F D E N F A B = C = A + B D + E = F = D E By using DeMorgan on the N gate symbol, one gets another equally valid symbol.- Both the with a negated output and the with negated inputs are equally valid symbols for a N gate. Ns with 3 or more inputs convert to an with 3 or more inverted inputs. In the same way, the N gate has two equally valid forms. X W U V Z = X W + U V X W U V N N N Z = X W + U V X W U V N N N Z = X W + U V Placing inverting circles back-to-back makes it possible to add negating circles to the outputs of the s, and the inputs of the, without changing the circuit function. This changes all three gates to N gates. FIGURE 8: Conversion of Fig. 6b to more common gates using DeMorgan s theorem. N N N N.9 Consider the lower block COMP 32. From the table in part X 3 X 2 X X Fig., observe that the output X 32, 2 =, never comes out Y 2 Y of block COMP 32 Thus in rows where X 32, 2 =, in the Y table for COMP 32, one can write down any output one wants; it will never happen. It turns out that the COMP 32 COMP 32 COMP circuit is smaller if these outputs are made 2,X 32 =,. X 32 X Y We call such outputs (for inputs that never happen) don t 32 Y care outputs. We could have made these outputs, or if we had wanted to, but making them gives a smaller circuit. COMP 32 X 32 2 The truth table of part Fig. 4 has been partially redone in Fig. 9 to apply to COMP 32 under the conditions that X 32, 2 =, and/or X, Y =, never happens. Thus the corresponding outputs have been made,. J.Knight,January 9, 4 SWITCHING CIRCUITS Lab -5

6 J.Knight, January 9, 4 SWITCHING CIRCUITS Lab-6 FIGURE 9:. Part of the truth table for COMP 32 with don t care outputs made,. X 32 X 2 Y X 32 2 Comparison as Y a a a 2-bit binary. = Y a Y a < Y a Y a < Y a Y a < Y a Y a > Y a make these outputs, Never happens =Y a Y a < Y a a a make these outputs, Never happens =Y a Minimize the logic equation for COMP 32 so X 32 uses an, two s, and some inverters. 2 uses the same. Write the equations.. Draw a circuit for COMP 32 using s s and inverters..2 Redraw the circuit using only gates available on the logic trainer, which were not previously used..3 The complete circuit you are about to build is likely larger than anything you have wired before. It is essential to plan it systematically. We strongly suggest the following Take the schematic diagrams of the generic subcircuit using the gates available on the logic trainer. Make sure it is uncrowded and neat without scratched out lines, or bubbles, s changed to s by scratching over the top, ditto marks, etc. Write the equation for the subcircuit underneath it. Use a separate sheet of paper from the wiring diagrams described next. Take the diagram of the Tektron logic lab. Select the gates you will use for each subcircuit. Draw a balloon around the gates in each block or, as done on the right, each half-block. Fill in the detailed wiring within the subcircuit. Use textual names to show the input and output signals entering or leaving your balloon, rather than the wires. If you show too many long wires your drawing will be so cluttered it will become useless. However the short wires inside the balloons are best drawn as lines. Y a Y a X 3 X 3 X 2 a = + Y a ( + ) COMP 32(X) X 32 a COMP ba (Y) a X 3 Y ab COMP 32(Y) Try using different colors. X 2 balloon Y 2 X 3 Lab -6 SWITCHING CIRCUITS J.Knight, January 9, 24

7 .4 The bottom block COMP 32 is simpler. Again be sure you have a good clear schematic using the available gates. Then add the wiring to the Tektron layout sheet. END OF PRELAB Constructing Your Circuit. The typical student is psychologically unprepared for the fact that they could make a wiring mistake. They tend to wire the complete circuit and then test it. We suggest you build and test the circuit in parts. Debugging five gates is far easier than debugging twenty. 2.5 Choose four switches for the X input and four for the Y input. Choose lights for X 32 = L x and 2 = L y, the final output. Choose two other pairs of lights to display X 32-2, and X -Y Before wiring, make sure the wires you use look clean on the ends. Also push each lead firmly into the hole. Grip the lead by the metal tip and give it a very slight ( degree) twist after inserting 2.7 Construct COMP : Wire the subcircuit. Wire X and Y to the switches. Wire X and Y to the switches. Wire X and Y their two lights. Test the subcircuit COMP. SWITCH OUTPUTS LAMP INPUTS X 32 2 X Y X3 X2 X X Y3 Y2 Y Y Lx Ly 9 Y X X X COMP X Y X Y 3 7 Y X 4 X 8 Y Construct COMP 32 in the same way. Test it too! 2.9 Construct COMP 32. Do not be in a hurry to connect it to the other blocks. First: Wire X 32 and 2 to two spare switches such as such as 8 and 9, to aid debugging. There are no more spare switches, but you can temporarily wire X and Y to the push buttons. J.Knight,January 9, 4 SWITCHING CIRCUITS Lab -7

8 J.Knight, January 9, 4 SWITCHING CIRCUITS Lab-8 Wire outputs X 32 and 2 to the L x and L y lights respectively. You can now test the subcircuit COMP 32. Remember the don t care inputs should give output PULSE OUTPUTS temporary connections 2.2 Remove the temporary connections and wire the complete comparator as it should be. 2.2 Debugging: Sometimes the plastic connection boards are loose in the connector in wooden frame. Push the heel of your hand on the plastic on the side of the board and push them in. If you are really having trouble it may be useful to use two trainers. Place them side by side and connect the GROUND pins by a lead. This will give you some extra debugging lights, and some less cluttered space. Check out and Clean Up 2 3 X 32 X X 32 COMP 32 Y 2 2 Lx Ly When your circuit works, demonstrate it to the teaching assistant. After demonstrating clean up your board, sort the leads, and put them back in their box. We have a contract with Lord Voldemont to deal with students who do not clean up. 9 Lab -8 SWITCHING CIRCUITS J.Knight, January 9, 24

9 Partial Layout of The Tektron Logic Lab. You should not need the JK flip-flops and RS latches which were omitted. PULSE OUTPUTS 2 3 CONSTANT OUTPUTS TEKTRON COMPUTER LOGIC LAB SWITCH OUTPUTS LAMP INPUTS J.Knight, January 9, 4 Lab -9 DIGITAL ELECTRONICS

10 Partial Layout of The Tektron Logic Lab. You should not need the JK flip-flops and RS latches which were omitted. PULSE OUTPUTS 2 3 CONSTANT OUTPUTS TEKTRON COMPUTER LOGIC LAB SWITCH OUTPUTS LAMP INPUTS J.Knight, January 9, 4 Lab - DIGITAL ELECTRONICS

CARLETON UNIVERSITY. X = Y 0 0 X > Y 1 0 X < Y 0 1 never 1 1 happens. Examples

CARLETON UNIVERSITY. X = Y 0 0 X > Y 1 0 X < Y 0 1 never 1 1 happens. Examples CARLETON UNIVERSITY Deparment of Electronics ELEC 2607 Switching Circuits January 17, 2005 Laboratory 1. Overview; A 4-Bit Binary Comparator X 3 X 2 X 1 X 0 COMPARATOR Y 3 Y 2 Y 1 Y 0 4 DATA BITS LEAST

More information

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder Overview The objective of this lab is to understand two basic combinational circuits the multiplexor and

More information

1 Boolean Algebra Simplification

1 Boolean Algebra Simplification cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.

More information

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of EE 2449 Experiment 11 Jack Levine and Nancy Warter-Perez CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 11 SEQUENTIAL CIRCUITS

More information

Experiment 7: Magnitude comparators

Experiment 7: Magnitude comparators Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization

More information

Combinational logic systems

Combinational logic systems Combinational logic systems Learners should be able to: (a) recognise 1/0 as two-state logic levels (b) identify and use NOT gates and 2-input AND, OR, NAND and NOR gates, singly and in combination (c)

More information

Chapter 1: Logic systems

Chapter 1: Logic systems Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR

More information

Foundations of Computation

Foundations of Computation The Australian National University Semester 2, 2018 Research School of Computer Science Tutorial 1 Dirk Pattinson Foundations of Computation The tutorial contains a number of exercises designed for the

More information

Latches. October 13, 2003 Latches 1

Latches. October 13, 2003 Latches 1 Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory

More information

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates. DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS AIM To design and implement encoders and decoders using logic gates. COMPONENTS REQUIRED S.No Components Specification Quantity 1. Digital IC Trainer

More information

Synchronous Sequential Circuit

Synchronous Sequential Circuit Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait

More information

Lecture 14 Finite state machines

Lecture 14 Finite state machines Lecture 14 Finite state machines Finite state machines are the foundation of nearly all digital computation. The state diagram captures the desired system behavior A formulaic process turns this diagram

More information

Digital Circuit Engineering

Digital Circuit Engineering Digital Circuit Engineering 2nd Distributive ( A)( B) = AB Circuits that work in a sequence of steps Absorption A = A A= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU G S CLK D Flip

More information

Digital Circuit Engineering

Digital Circuit Engineering Digital Circuit Engineering 2nd Distributive ( + A)( + B) = + AB Circuits that work in a sequence of steps Absorption + A = + A A+= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU S

More information

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

Computers also need devices capable of Storing data and information Performing mathematical operations on such data Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable

More information

The Design Procedure. Output Equation Determination - Derive output equations from the state table

The Design Procedure. Output Equation Determination - Derive output equations from the state table The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types

More information

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html

More information

Learning Objectives:

Learning Objectives: Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how -type flip-flops can be connected to form a synchronous counter to meet a given specification; explain

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter

More information

Philadelphia University Student Name: Student Number:

Philadelphia University Student Name: Student Number: Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018

More information

CSCI 2150 Intro to State Machines

CSCI 2150 Intro to State Machines CSCI 2150 Intro to State Machines Topic: Now that we've created flip-flops, let's make stuff with them Reading: igital Fundamentals sections 6.11 and 9.4 (ignore the JK flip-flop stuff) States Up until

More information

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Chapter 1.10 Logic Gates 1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Microprocessors are the central hardware that runs computers. There are several components that

More information

Combinational Logic Design Combinational Functions and Circuits

Combinational Logic Design Combinational Functions and Circuits Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders

More information

Mealy & Moore Machines

Mealy & Moore Machines Mealy & Moore Machines Moore Machine is a finite-state machine whose output values are determined solely by its current state and can be defined as six elements (S, S 0, Σ, Λ, T, G), consisting of the

More information

Philadelphia University Student Name: Student Number:

Philadelphia University Student Name: Student Number: Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016

More information

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.

More information

Implementation of Boolean Logic by Digital Circuits

Implementation of Boolean Logic by Digital Circuits Implementation of Boolean Logic by Digital Circuits We now consider the use of electronic circuits to implement Boolean functions and arithmetic functions that can be derived from these Boolean functions.

More information

Boolean Algebra & Digital Logic

Boolean Algebra & Digital Logic Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to

More information

Different encodings generate different circuits

Different encodings generate different circuits FSM State Encoding Different encodings generate different circuits no easy way to find best encoding with fewest logic gates or shortest propagation delay. Binary encoding: K states need log 2 K bits i.e.,

More information

CHAPTER1: Digital Logic Circuits Combination Circuits

CHAPTER1: Digital Logic Circuits Combination Circuits CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.

More information

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL. 2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two

More information

6 Simplification of. Boolean Functions

6 Simplification of. Boolean Functions 6 Simplification of Boolean Functions This experiment demonstrates the relationship between a Boolean function and the corresponding logic diagram. The Boolean functions and their complements are simplified

More information

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)

More information

Simplifying Logic Circuits with Karnaugh Maps

Simplifying 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 information

Synchronous Sequential Circuit Design. Digital Computer Design

Synchronous Sequential Circuit Design. Digital Computer Design Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always

More information

Analysis of Clocked Sequential Circuits

Analysis of Clocked Sequential Circuits Objectives Analysis of Clocked Sequential Circuits The objectives of this lesson are as follows: Analysis of clocked sequential circuits with an example State Reduction with an example State assignment

More information

15.1 Elimination of Redundant States

15.1 Elimination of Redundant States 15.1 Elimination of Redundant States In Ch. 14 we tried not to have unnecessary states What if we have extra states in the state graph/table? Complete the table then eliminate the redundant states Chapter

More information

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date. Schedule Date Day Class No. Dec Mon 25 Final Review 2 Dec Tue 3 Dec Wed 26 Final Review Title Chapters HW Due date Lab Due date LAB 8 Exam 4 Dec Thu 5 Dec Fri Recitation HW 6 Dec Sat 7 Dec Sun 8 Dec Mon

More information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering SEQUENTIAL CIRCUITS: LATCHES Overview Circuits require memory to store intermediate

More information

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015 University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 1/13 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices Show all work on the front

More information

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Boolean Logic Prof. James L. Frankel Harvard University Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Logic Levels Logic 0 Also called GND Low Off False Logic

More information

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1 E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us

More information

Sequential Circuit Analysis

Sequential Circuit Analysis Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll

More information

Q: Examine the relationship between X and the Next state. How would you describe this circuit? A: An inverter which is synched with a clock signal.

Q: Examine the relationship between X and the Next state. How would you describe this circuit? A: An inverter which is synched with a clock signal. /2/2 OF 7 Next, let s reverse engineer a T-Flip flop Prob. (Pg 529) Note that whenever T is equal to, there is a state change, otherwise, there isn t. In this circuit, (x) determines whether the output

More information

Physics 2020 Laboratory Manual

Physics 2020 Laboratory Manual Physics 00 Laboratory Manual Department of Physics University of Colorado at Boulder Spring, 000 This manual is available for FREE online at: http://www.colorado.edu/physics/phys00/ This manual supercedes

More information

Boolean Algebra and Digital Logic

Boolean Algebra and Digital Logic All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types

More information

Introduction to Karnaugh Maps

Introduction to Karnaugh Maps Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer

More information

CMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo

CMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo CMSC 33 Lecture 6 nnouncement: no office hours today. Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly

More information

Chapter 5 Synchronous Sequential Logic

Chapter 5 Synchronous Sequential Logic Chapter 5 Synchronous Sequential Logic Sequential circuit: A circuit that includes memory elements. In this case the output depends not only on the current input but also on the past inputs. Memory A synchronous

More information

University of Minnesota Department of Electrical and Computer Engineering

University of Minnesota Department of Electrical and Computer Engineering University of Minnesota Department of Electrical and Computer Engineering EE2301 Fall 2008 Introduction to Digital System Design L. L. Kinney Final Eam (Closed Book) Solutions Please enter your name, ID

More information

Written reexam with solutions for IE1204/5 Digital Design Monday 14/

Written reexam with solutions for IE1204/5 Digital Design Monday 14/ Written reexam with solutions for IE204/5 Digital Design Monday 4/3 206 4.-8. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 08-7904487 Exam text does not have to be returned

More information

Digital Circuits and Systems

Digital Circuits and Systems EE201: Digital Circuits and Systems 4 Sequential Circuits page 1 of 11 EE201: Digital Circuits and Systems Section 4 Sequential Circuits 4.1 Overview of Sequential Circuits: Definition The circuit whose

More information

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2. Digital Circuits 1. Inputs & Outputs are quantized at two levels. 2. inary arithmetic, only digits are 0 & 1. Position indicates power of 2. 11001 = 2 4 + 2 3 + 0 + 0 +2 0 16 + 8 + 0 + 0 + 1 = 25 Digital

More information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS

More information

Parity Checker Example. EECS150 - Digital Design Lecture 9 - Finite State Machines 1. Formal Design Process. Formal Design Process

Parity Checker Example. EECS150 - Digital Design Lecture 9 - Finite State Machines 1. Formal Design Process. Formal Design Process Parity Checker Example A string of bits has even parity if the number of 1 s in the string is even. Design a circuit that accepts a bit-serial stream of bits and outputs a 0 if the parity thus far is even

More information

Building a Computer Adder

Building a Computer Adder Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.

More information

CSC258: Computer Organization. Digital Logic: Transistors and Gates

CSC258: Computer Organization. Digital Logic: Transistors and Gates CSC258: Computer Organization Digital Logic: Transistors and Gates 1 Pre-Class Review 1. What are the largest (positive) and smallest (negative) numbers that can be represented using 4- bit 2 s complement?

More information

University of Technology

University of Technology University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates

More information

Synchronous Sequential Logic

Synchronous Sequential Logic 1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in

More information

CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo

CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo CMSC 33 Lecture 5 Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly Language What a pain! Understand

More information

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3 Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible

More information

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee ECE/CS 250: Computer Architecture Basics of Logic Design: Boolean Algebra, Logic Gates Benjamin Lee Slides based on those from Alvin Lebeck, Daniel Sorin, Andrew Hilton, Amir Roth, Gershon Kedem Admin

More information

Boolean Logic Continued Prof. James L. Frankel Harvard University

Boolean Logic Continued Prof. James L. Frankel Harvard University Boolean Logic Continued Prof. James L. Frankel Harvard University Version of 10:18 PM 5-Sep-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. D Latch D R S Clk D Clk R S X 0 ~S 0 = R 0 ~R

More information

Week-I. Combinational Logic & Circuits

Week-I. Combinational Logic & Circuits Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and

More information

Digital Logic (2) Boolean Algebra

Digital Logic (2) Boolean Algebra Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh

More information

Chapter 9 Asynchronous Sequential Logic

Chapter 9 Asynchronous Sequential Logic 9.1 Introduction EEA051 - Digital Logic 數位邏輯 Chapter 9 Asynchronous Sequential Logic 吳俊興高雄大學資訊工程學系 December 2004 Two major types of sequential circuits: depending on timing of their signals Asynchronous

More information

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: S. Brown,

More information

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of

More information

UNIVERSITY OF WISCONSIN MADISON

UNIVERSITY OF WISCONSIN MADISON CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,

More information

Binary addition example worked out

Binary addition example worked out Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0

More information

Review: Additional Boolean operations

Review: Additional Boolean operations Review: Additional Boolean operations Operation: NAND (NOT-AND) NOR (NOT-OR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1

More information

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100

More information

DE58/DC58 LOGIC DESIGN DEC 2014

DE58/DC58 LOGIC DESIGN DEC 2014 Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5

More information

MA 3260 Lecture 10 - Boolean Algebras (cont.) Friday, October 19, 2018.

MA 3260 Lecture 10 - Boolean Algebras (cont.) Friday, October 19, 2018. MA 3260 Lecture 0 - Boolean Algebras (cont.) Friday, October 9, 208. Objectives: Boolean algebras on { 0, }. Before we move on, I wanted to give you a taste of what the connection between Boolean algebra

More information

ECE 2300 Digital Logic & Computer Organization

ECE 2300 Digital Logic & Computer Organization ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed

More information

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Following the slides of Dr. Ahmed H. Madian Lecture 10 محرم 1439 ه Winter

More information

Combinational Logic Trainer Lab Manual

Combinational Logic Trainer Lab Manual Combinational Logic Trainer Lab Manual Control Inputs Microprocessor Data Inputs ff Control Unit '0' Datapath MUX Nextstate Logic State Memory Register Output Logic Control Signals ALU ff Register Status

More information

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions? Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation

More information

COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University 1 OEN 312 DIGIAL SYSEMS DESIGN - LEURE NOES oncordia University hapter 6: Registers and ounters NOE: For more examples and detailed description of the material in the lecture notes, please refer to the

More information

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS OBJECTIVES: Simplify Boolean functions using K-map method Obtain Boolean expressions from timing diagrams Design and implement logic circuits Equipment

More information

Simplify the following Boolean expressions and minimize the number of literals:

Simplify the following Boolean expressions and minimize the number of literals: Boolean Algebra Task 1 Simplify the following Boolean expressions and minimize the number of literals: 1.1 1.2 1.3 Task 2 Convert the following expressions into sum of products and product of sums: 2.1

More information

Lecture (08) Synchronous Sequential Logic

Lecture (08) Synchronous Sequential Logic Lecture (08) Synchronous Sequential Logic By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II Analysis of Clocked Sequential Circuits The behavior of a clocked sequential

More information

Logic Design. Chapter 2: Introduction to Logic Circuits

Logic Design. Chapter 2: Introduction to Logic Circuits Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic

More information

The course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab.

The course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab. Circuits Lab Names: Objectives Learn how circuits work, different properties of circuits, and how to derive truth tables, circuits from functions and simply circuits using Boolean circuit equivalence..

More information

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017 UNIVERSITY OF BOLTON TW35 SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER 2-2016/2017 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002

More information

Exam for Physics 4051, October 31, 2008

Exam for Physics 4051, October 31, 2008 Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following

More information

Combinational Logic. By : Ali Mustafa

Combinational Logic. By : Ali Mustafa Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output

More information

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering

More information

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014 Page 1/12 Exam 1 May the Schwartz Instructions: be with you! Turn off all cell phones and other noise making devices and put away all electronics Show all work on the front of the test papers Box each

More information

Chapter 3 Combinational Logic Design

Chapter 3 Combinational Logic Design Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts

More information

Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1

Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1 Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember

More information

Synchronous Sequential Circuit Design

Synchronous Sequential Circuit Design Synchronous Sequential Circuit Design 1 Sequential circuit design In sequential circuit design, we turn some description into a working circuit We first make a state table or diagram to express the computation

More information

Written exam with solutions IE1204/5 Digital Design Friday 13/

Written exam with solutions IE1204/5 Digital Design Friday 13/ Written eam with solutions IE204/5 Digital Design Friday / 207 08.00-2.00 General Information Eaminer: Ingo Sander. Teacher: Kista, William Sandqvist tel 08-7904487 Teacher: Valhallavägen, Ahmed Hemani

More information

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra

More information

Digital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.

Digital electronic systems are designed to process voltage signals which change quickly between two levels. Low time. DIGITL ELECTRONIC SYSTEMS Digital electronic systems are designed to process voltage signals which change quickly between two levels. High Voltage Low time Fig. 1 digital signal LOGIC GTES The TTL digital

More information

Slide Set 6. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Slide Set 6. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary Slide Set 6 for ENEL 353 Fall 2017 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2017 SN s ENEL 353 Fall 2017 Slide Set 6 slide

More information

Time Allowed 3:00 hrs. April, pages

Time Allowed 3:00 hrs. April, pages IGITAL ESIGN COEN 32 Prof. r. A. J. Al-Khalili Time Allowed 3: hrs. April, 998 2 pages Answer All uestions No materials are allowed uestion a) esign a half subtractor b) esign a full subtractor c) Using

More information