ECSE-4760 Real-Time Applications in Control & Communications EXPERIMENTS IN DIGITAL LOGIC DESIGN

Size: px
Start display at page:

Download "ECSE-4760 Real-Time Applications in Control & Communications EXPERIMENTS IN DIGITAL LOGIC DESIGN"

Transcription

1 Rensselaer Polytechnic Institute ESE-476 Real-Time pplications in ontrol & ommunications EXPERIMENTS IN DIGITL LOGI DESIGN Number of Sessions 4 INTRODUTION Over the past few decades the digital world has come into its own. Even though engineering has gone into specialization, it is necessary to understand digital circuits to be able to communicate with others. This experiment attempts to teach a simple method of designing digital circuits. Due to the quick pace of the lab, it is highly recommended that you read one of the references. This will enable you to proceed quickly through the preliminary problems so you will have more time for the design problems. The following is an outline of the experiment. ollowing each section will be a set of questions that should be answered to show an understanding of the material presented. ny difficulties should be referred to a reference or your instructor. You should use the DesignWorks (LogicWorks or any other you may have) logic circuit simulator on the Macintosh after most sections to cement together all the preceding sections. KGROUND THEORY oolean lgebra Switching lgebra ombinational Logic Minimization lip-lops and Registers ounters Synthesis of Synchronous ircuits EXPERIMENTL PROEDURE uestions and Problems Simulator Operation REERENES It is required that you show all circuits, as built, in your write-up. Please include equations too. The first part of the procedure section contains all the questions and problems to be answered and the second part describes the use of DesignWorks. Note: all references to DesignWorks (on Macintosh computers) throughout this procedure may be replaced with LogicWorks on the lab Windows Ps.

2 KGROUND THEORY Since the digital world consists of discrete levels, functions can be described in truth tables as opposed equations for the continuous world. The three basic digital functions are ND, OR, and NOT. Their symbols and truth tables are shown below. These functions (from now on called gates) are such that as soon as the inputs change, the outputs will also change. (There actually is a small delay dependent on the type of gate. See reference [].) INPUT OUTPUT IGURE. ND gate and truth table. INPUT OUTPUT IGURE 2. OR gate and truth table. INPUT OUTPUT IGURE 3. NOT gate and truth table. Very often an OR and ND gate will have a NOT at the end of it (because of hardware considerations). These will then be called NOR and NND gates respectively. Please do problem in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. OOLEN LGER George oole (85-64) introduced an algebra of logic in the mid-8's, however, the presentday application of oolean algebra is credited to a paper by. Shannon in 938. The techniques and manipulations provided by oolean lgebra are a necessity to efficient logic design.. Definition set of elements and two binary operations '+' and ' ' over form a oolean lgebra {, +, } if and only if the following postulates hold: 2

3 Postulate - The set of objects or elements are subject to an equivalence relationship, denoted '=', which satisfies the principle of substitution, i.e., if =, may be substituted for in any expression involving without affecting the validity of the expression. s in ordinary algebra, the letters of the alphabet are used to represent variables. Postulate 2 (losure) - Whenever, then ( + ) ( ) Postulate 3 (Identity) - There exist two identity elements (called and ) such that: + = + = (additive identity) = = (multiplicative identity) Postulate 4 - '+' and ' ' are: i. commutative + = + = ii. associative + ( + ) = ( + ) + ( ) = ( ) iii. distributive over each other ( + ) = ( ) + ( ) + ( ) = ( + ) ( + ) Postulate 5 - or every element in there exists an element (termed the complement of ) such that: + = = Postulate 6 - There are at least two elements X and Y in such that X Y.. Theorems. The and elements are unique. 2. or every element in : + = and = 3. + = and = 4. The elements and are distinct and = or = = and ( + ) =. This is often termed the absorption rule. (The ' ' is understood, thus = ) 6. = ( ) = 7. + = + and ( + ) = 8. ( + ) ( + ) = + and + + = + 9. DeMorgan's Theorem = +. Duality + = Notice that the previous postulates and theorems were given in pairs. In each case one postulate in a pair can be obtained from the other by interchanging and along with '+' and ' '. This is called the principle of duality. Every theorem which can be proven for oolean algebra has a dual which is also true. or example: + = = and + ( ) = ( + ) ( + ) ( + ) = ( ) + ( ) 3

4 SWITHING LGER Switching algebra is a mathematical framework for the design and analysis of logic networks using binary decision-making elements such as NND and NOR gates. The distinctive feature is that variables and functions can assume only two values, and. Thus Switching algebra is a subset of oolean algebra restricted to two elements ( =, ). Switching algebra will provide a means of describing functional relationships in a form that corresponds precisely to a network of gates.. Properties of Switching lgebra. Distinctness of and X if and only if X = X if and only if X = 2. Operations ND, ' ' = = = = OR, '+' + = + = + = + = NOT, ' ' = = The associative law allows us to extend definitions of ND and OR to many variables. Thus for Z = D + E, then Z = if any of,,, D, or E is, in any combination. Similarly Z = DE is if and only if all the variables,,, D, and E are.. DeMorgan's Theorem The two basic duals of the theorem are: XY = X + Y X + Y = X Y DeMorgan's theorem as well as other theorems can be extended to many variables: DE... = D + E =... DeMorgan's theorem expresses a relationship between ND and OR that is important to recognize. onsider the equation Z = + +. We could interpret this as Z = when or or is. n alternative is Z = if and and are. This is represented by Z = which is equivalent to Z = + + by DeMorgan's theorem. ll this leads to the need to realize that a gate can be realized by its dual using DeMorgan's theorem. Some examples are as follows: 4

5 ND version OR version = = + circle represents a NOT. = = + = = + IGURE 4. It is important to note that and are not equivalent expressions. The truth table for both is shown below. INPUT OUTPUT _ IGURE 5. nswer question 2 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. OMINTIONL LOGI ombinational logic refers to networks whose outputs depend solely on their inputs, and not on any previous state. The analysis of combinational logic requires the writing of the oolean algebra equation for each element of the network, and then combining these for the final output equation. or example: E E 2 E = E 2 = E 3 = E + E 2 = + IGURE 6. The truth table is: 5

6 INPUT OUTPUT Sequence IGURE 7. DeMorgan's theorem states that = +. Therefore a NND gate is also a NOT OR gate, as shown below. 2 = IGURE 8. 2 = + When analyzing NND circuits, a NOTed-OR can be substituted in place of a NND gate. This is usually done at odd levels as shown below. E E D E 2 E = E = D E 2 2 E 2 = D = D = + D = 2 IGURE 9. NND gates are used mainly for the simplicity of their hardware components. nalysis of NOR circuits follows similar reasoning. Synthesis of combinational logic is just the reverse of analysis. Implement each section of a oolean equation and then OR or ND the sections together to get the final output. or example, implement = + D using NND logic. 6

7 E E = D E 2 E 2 = D = + D IGURE. Implement = + D( + ) D E 2 E E 3 E = E 2 = + E 3 = D( + ) = + D( + ) IGURE. Sum of Products, Products of Sums There are two basic forms in which a oolean algebraic expression can be written. These are the sum of products (SOP) and the product of sums (POS). That is, the expression + is an ORing of the two NDed terms. The NDed terms, and, are called product terms. The ORing is the sum of the terms. Therefore, the above expression is a sum of products. Likewise, a product of sums expression could be ( + )( + ). nswer question 3 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. MINIMIZTION lgebra theorems provide the fundamental tools of minimization. Reduction such as + = + are easily recognized while others, such as + +, are not as obvious. or example, reduce = D by algebraic manipulation Reduce = ( + ) + + D = + + D = + + D = + + = + ( + ) + = = (+ ) + ( +) = + lgebraic reduction of oolean functions is not easy and requires considerable experience, judgment, and luck. This becomes more apparent as the complexity of the function increases. s a result, the use of Karnaugh Maps, which is a powerful tool in minimizing logic, will be taught. 7

8 . Karnaugh Maps Each variable can exist as either of two values; and. Two squares can represent this. IGURE 2. Similarly, two variables can be described as follows: or IGURE 3. Thus =, =, =, =. The map then looks as follows: IGURE 4. The two combinations of are listed on top, and the two combinations of are listed on the side. The intersections form the four unique combinations of the two variables. The K-map representation is constructed by placing a in any cell for which the function of the variables is. Therefore the function = + can be mapped as: = + IGURE 5. The way of minimizing algebra can be easily seen by the function = + = = + IGURE 6. It can be obviously seen from the map that when =, = regardless of the value of. It is this property, of visually recognizing two adjacent ones, that makes K-maps such a powerful tool. lthough the 2-variable problem is trivial, K-maps can be extended to 3, 4, and more variables. 8

9 D D D D D D D _ D D _ D _ D D _ D D D D D. Minimum Sum of Products IGURE 7. Methods of representing 3 and 4 variable maps. There are two rules. The first is to order the variables so that only one variable changes at a time (see IGURE 7). This is important because when two adjacent valued cells are paired, only one variable changes and that is the redundant variable. The second rule is to group the 's in the largest power of two possible. This way one, two, or more variables can be seen as redundant. or example, = D + D + D + D + D + D + D can be minimized as follows. D IGURE 8. y pairing 's, reduces to D + D + D +. Notice that groups can be extended off the edge of the map. ontinuing by trying to group the largest power of two takes the following form. D IGURE 9. The function is now = D + D +. Notice how the four corners combine. This may seem odd, but if the map is enlarged (adding no new information), this will become obvious. 9

10 D IGURE 2. There are times when you have a choice in covering (drawing circles around) the 's. In this case you pick the coverage that suits other parameters. or example, D = D + D + D or = D + D + IGURE 2. To include both covers would add a redundant term to. In summary, to minimize the terms of a function, get the fewest covers, covering the largest area possible. s a closing note, sometimes there will arise a switching application that will not contain all the possible values needed to fill a K-map. In this condition, you don't really care if a cell is zero or one. Therefore it is correct to cover the largest possible area including don't care's. or example, D d d = don t care d = + d IGURE 22. nswer question 4 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. LIP-LOPS ND REGISTERS One of the most common types of memory is the flip-flop (otherwise known as the bistable multivibrator). The four we will be concerned about are S-R, J-K, T, and D. The characteristics of

11 each of the flip-flops will be covered in this section. The input is the clock input used in some flipflops to synchronize transitions.. S-R lip-lop (LTH) IGURE 23 shows the logic circuit for the flip-flop constructed with two NND gates. lso shown are the symbol and operation table. Note that the output is not necessarily the complement of. S R (a) Logic ircuit `S `R (b) Symbol INPUT S R previous OUTPU T value IGURE 23. Latch. (c) Operation Table s can be seen, the outputs are uniquely determined by the inputs except for the (,) condition where the output stays at its previous state. Problems occur when the inputs switch from (,) to (,) simultaneously. In the real world there would be a race between the gates.. J-K lip-lop IGURE 24 shows the symbol and operation table for a J-K flip-flop. J K (a) Symbol INPUT OUTPUT J K n o c h a n g e c o m p l e m e n t (b) Operation Table IGURE 24. J-K flip-flop.. D lip-lop IGURE 25 shows the symbol and operation table for a D flip-flop. s can be seen, it is easily constructed from a J-K flip-flop.

12 J K (a) Logic ircuit D (b) Symbol INPUT OUTPUT (after.p.) D IGURE 25. D flip-flop. (c) Operation Table The D flip-flop will simply assume the state of the input after a clock pulse. This is useful as a delay element and when transferring bits from one source to another. The D flip-flop is commonly used in shift registers. D. T lip-lop IGURE 26 describes the T flip-flop. s shown, the T flip-flop is simply a J-K flip-flop with the two inputs connected. It is commonly used in counters. J K (a) Logic ircuit T (b) Symbol INPUT OUTPUT (after.p.) T n o c h a n g e c o m p l e m e n t IGURE 26. T flip-flop. (c) Operation Table E. Shift Registers Shift registers occupy an important position in most digital systems. They are often used to momentarily store binary information needed to be coded or decoded. They also play an important link between systems using sequential I/O channels. The flip-flops in a register must be wired so binary data can be inserted (shifted) into the register, and probably shifted out as well.. Serial Shift Registers Serial shift registers involve shifting bits into the register one at a time in a series fashion. five bit serial shift register is shown below using D flip-flops. Data shifts from a flip-flop to the next one to its right, on each clock pulse. 2

13 2 3 4 DT INPUT D D D D D DT OUTPUT IGURE 27. Serial shift register. Data can be taken out in a parallel or serial fashion, as shown. G. Parallel Load Shift Registers second method of loading a register is by shifting in all the bits in parallel at the same time (for example from a decoder). n example of a 3-bit parallel shift register is shown below. SHIT X 2 X X J K J J K K RESET IGURE 28. When the shift line goes high, the outputs of the ND gates take on the values of X. On the next clock, this information is shifted into the register. To reset the register, the reset line goes high and the shift line low so that all the 's will turn low on the next clock pulse. Thus this configuration requires two clock pulses; one to reset and one to load. Probably the most useful register is a parallel load, serial shift register that lets you control either mode. That type of register incorporates the two previous techniques. nswer question 5 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. OUNTERS Only synchronous counters will be described because of their simplicity. synchronous counter is one in which all the flip-flops change state simultaneously since all the clocks inputs are tied together. ounters are usually constructed of T flip-flops since the flip-flops only have to toggle at a given sequence. 3-bit synchronous counter is shown below. 3

14 T T T 2 3 IGURE it synchronous counter. The equations for the flip-flops are T = ; T2 = ; T3 = 2. Thus T toggles at every clock pulse, T2 toggles only when is high, on every other clock pulse, and finally T3 toggles when both and 2 are high, or every fourth clock pulse. The counting sequence is shown below: STTE ount r e p e a t IGURE 3. ounting sequence. This type of counter can be extended by the following set of equations. T = ounter Designs T2 = T T3 = TT2 Tn = TT2 Tn- The 'Detect and Steer' method works by constructing the appropriate combinational control logic at the input of each flip-flop so that the counter progresses through the desired states. list of general steps used to design a counter by this method is shown below.. Start by writing the desired counting sequence. 2. rom determine which flip-flop must change when going from the last state to the first. 3. Generate the control circuitry for each flip-flop from the analysis done in This can best be shown by the following design of a Mod- synchronous binary counter. 4

15 STTE is the most significant bit ount D Decimal D is the least significant bit 2 2 changes , change changes ,, change 9 9 Inhibit D, orce & 2 r e p e a t changes, change IGURE 3. To find the expression for the T flip-flop inputs, note that there are several unused states that will add don t cares to the K-map. These are D =,,, &. or the T4 input for, this flip-flop should change (T4 = ) when D = &. The K-map with the don t cares will be: D d = don t care d d d d T 4 = D + d Similarly, T3 for needs to be when D = &. The corresponding K-map is: D d = don t care d d d d T 3 = D d You should work out the expression for s T2 flip-flop, noting that there will be six s in the K-map. The T expression for D could also be done this way, but since D changes almost every time, it is easier to look at the case when it doesn t change. Instead of filling up the K-map with all s except 5

16 for the lower right corner, we will put a in for the D = state and find the inverse (NOT) expression. Now the K-map will look like: D d = don t care d d d d T = d Once we detect the state for D (detecting ) we can summarize all the T flip-flop input expressions: D = T = inhibits only on ; otherwise = T2 = D + is the force term = T3 = D = T4 = D + is the force term The logic for the Mod- counter is shown below: T T T T D IGURE 32. nswer question 6 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. SYNTHESIS O SYNHRONOUS IRUITS (see Ref. [2]) The synthesis of a logic circuit is one of the most difficult aspects of digital circuit design. The designer must balance the cost of his time spent on the design to the cost of the logic used. (This really applies to prototypes. or production, the designer will be more interested in minimizing his circuit than minimizing his time.) There is a method, which will be explained, that minimizes the designer's time spent working out his circuit, and maximizes his time where thought process is needed flow-charting. low-charting is used everywhere. In composition it is called an outline. Programmers use it. In flow-charting a finite state machine, the designer takes all the specs and puts it into his flow chart. Let's take a simple example - the design of a Mod-8 counter. You already know how to design T- counters. This time we will synthesize a D- counter. Since 8 distinct outputs are needed, the design calls for 8 states since each output will depend on the state you are in. The flow chart is as follows: 6

17 / / / / D / E / / G / H IGURE 33. Each state is represented by a circled letter. The arrow points to the next state following a clock pulse. or a simple counter, the arrows just follow a string. The number following the slash shows the desired output at each transition. If there was an input it would be put in front of the slash. Let's continue. Suppose we wanted an up/down counter dependent upon an input, X. When X = the counter counts up and for X = the counter counts down. The implementation of this flow chart is just as simple. We now have arrows in both directions, dependent on X. X/ X / D E G H X/ X / X/ X / X/ X / X/ X / X/ X / X/ X / X/ X / IGURE 34. On X (when X = ) the arrows point backwards. The outputs follow similar reasoning. Now for a final extension. The new design calls for two inputs X,Y. On, you have a down counter; on, you have an up counter; and on, and, you stop counting. Only the first 4 states will be shown. / / / / / / / / D / / / / IGURE 35. / / Once a good working flow chart has been accomplished (minimization will not be covered) the rest is pure mechanics. The step after the flow chart is to write a state table. Let's work on a simple 4 state up/down counter. This table simply lists each state on the left, and the transition to the next state inside the box, dependent on the input variable X. rom the state table, an excitation table is written. Using K-map techniques, a state representation is made and inserted for each state. Notice that only one variable changes at a time when using a K-map. Using K-map techniques, the equations for each flip-flop are found. Note that 2 are the outputs of flip-flops. The digits inside the box are for the inputs of the flip-flops. 7

18 X X 2 D () = X 2 + X 2 () D () 2 = X + X D (D) State Table Excitation Table Excitation Equations IGURE 36. Going back to the flow chart, an output table is written. It may seem a little odd that each state codes for two outputs, but you must realize that the coding is for the next state, not the immediate state. inally, the equations for the outputs are written. X 2 () () () (D) Output Table O = X 2 + X 2 = O 2 = Output Equations IGURE 37. That is all there is to this type of synchronous synthesis. Once the equations are written, they can easily be converted to actual logic. Here is one more example and then you are on your own. It is desired to design a synchronous machine to decode a series of ones and zeros into a special output sequence. The input is X and the output is Z: start continue X X Z Z The first observation is that there is a output for every input. The next observation is that the output toggles on a zero input after the first zero input. Start with state. On a input, a is output and there is no need to leave state. On the other hand, there are two outputs for a zero input so it takes 2 states to code for the two outputs. Therefore the flow chart is as follows: / / / Notation: INPUT/OUTPUT / IGURE 38. Note that all possible inputs at every state are accounted for. In this particular case, there are a few simple flow charts that will do the trick. Experience will allow you to pick the simplest. In this case, since we will use a D- and assign for state, it is simplest to let everything fall back to. The state-output table is: 8

19 X / / / / State-Output Table IGURE 39. The excitation table and equation is: X () () Excitation Table = X Excitation Equation IGURE 4. the output table and equation is: X () () Output Table O = X + Output Equation IGURE 4. The final circuit is simply X D IGURE 42. O nswer question 7 in the UESTIONS ND PROLEMS of the EXPERIMENTL PROEDURE. EXPERIMENTL PROEDURE UESTIONS ND PROLEMS This procedure consists of seven short answer problems and one major design project. You should plan to finish questions - 7 during one lab session. The other 3 sessions are to be devoted to your design project. 9

20 ll the problems solved should have figures, either drawn by hand or printed out from DesignWorks. If you are printing out circuits, move them to the top of the page. This will save paper and speed up printing. You may also construct several circuits on the same page before printing.. a) uild (from this point on, the word build will be used to mean design, test, and write in your lab book) a four input NND gate using gates with 2 inputs. Write down the truth table. b) Do the same for a 4 input NOR gate. 2. a) Prove to yourself DeMorgan's theorem using DesignWorks. b) Show, one step at a time, that + ( ) = ( + ) ( + ) for =, =, =. c) What is the dual of: ( + ) + (D ) ( + D) 3. a) nalyze the following in two ways to get sums of product and product of sums equations. Then show how you can get one from the other using DeMorgan's Theorem. E D IGURE 43. E 2 b) Implement = + using NND logic. + is called an exclusive or. Draw a truth table and test it on the simulator. 4. a) Minimize = D + D + D + D + D + D + D. Test out both versions on DesignWorks. b) Minimize and give the truth table for the reduced version where = D E + D E + D E + D E + D E + D E + D E + D E + D E + D E (Note that this can be reduced to a 4 variable map.) c) Write the equation for the following: 2

21 D d d d d d d = don't care IGURE a) amiliarize yourself with the flip-flops available on DesignWorks by entering them and testing them. b) Use the clock on a J-K flip-flop. Naming the clock signal and the output gives a timing diagram. c) Simulate a 3-bit serial shift using J-K flip-flops and a switch for the input. 6. Design and build a counter that will go through the following sequence. Show all work. STTE D r e p e a t Note: state '4' is skipped IGURE a) uild a one stage full adder with inputs X, Y, and carry in from previous stage. There should be outputs of a sum and a carry out. Draw the necessary truth tables. b) How could this be expanded to create an n-stage adder? ssuming each gate has a delay, can all the n bits be added at the same time? 8. Decide on a project, design it and build it. Show your instructor what your project is before you start it. This project should be fairly complicated and not a common function from a TTL data book. function that accepts certain inputs in certain sequences and causes different patterns to appear on the available outputs is appropriate. In other words, the design should be unique. See guidelines below. 2

22 DESIGN PROJET or this final part of the logic design lab, you are to design and implement a machine of your own choice on DesignWorks. Here are some hints and rules:. The design must have both combinational and sequential logic (flip-flops). 2. The design must have some user input (more is usually better). 3. The design must have some output (more is usually better). 4. The design must be implementable, even if your attempt to implement it didn't quite work (in which case say why it didn't work in your lab report). 5. Show your T.. the working model and he will sign it. 6. In short, the more impressive your design, the higher your grade (if it works). If your design does something fantastic, say so on your lab write-up. rag about your design. 7. The design ought to be relevant. That is, it should do something that has some use (even a game), rather than some arbitrary function. 8. ll parts of the design ought to have a bearing on the output; i.e., a flip-flop connected to nothing doesn't satisfy the requirements of sequential logic. ollowing these simple guidelines this should produce a good project. Suggested projects are:. simple game like Mastermind. 2. message scroll. 3. traffic light controller. 4. serial to parallel/parallel to serial converter. 5. n rithmetic-logic Unit (LU). You may use the hex-keyboard and display options wherever needed or desired. There is a device editor available on DesignWorks that allows you to make your design modular. You are encouraged to do this. SIMULTOR OPERTION Some Pointers on the Use of DesignWorks Listed are some points that should help you get started on the DesignWorks package on the Macintosh. lso shown is a simple example. Students are advised to work through the example before proceeding with the lab. urther information on the package should not be difficult to find from the manual. The manual should also be able to give you ideas for the final design project.. Open the DesignWorks folder by clicking the mouse twice on it. 2. lick twice on the icon labeled DesignWorks (or latest version). 3. If necessary, go to the ile menu at the top of the screen and open a new circuit. circuit template and a timing diagram appears on the screen. Work through the example shown below. Example Let us try to construct the circuit shown below: IGURE 46. Example circuit. 22

23 The following components have to be assembled: NND gate: Select a 2-input NND gate NND-2 from the Gates option within the selection labeled Libraries at the top of the screen. mouse click places the NND gate or any other selected component on the circuit template. Repeated clicks will place additional components. When you have all the gates you need, press the Space ar. This will yield the cursor. onnections: connection may be made by clicking the cursor near a lead, and drawing it across to the required place. When a connection is established between two circuit components, the signal line flashes briefly. Naming signals: t the bottom left corner of the circuit template is a set of cursor selections. Select the pen. licking the pen on a signal line causes it to flash, and a text cursor appears. Name the signal and press return when done. The signal will immediately be assigned an area on the timing diagram. Label the signals,, and as shown in IGURE 46. In addition, the pen may be used to write any text on the circuit template; e.g. the NND gate may be labeled NND. Switch: To be able to change the values of the input, switches need to be connected to points and. Select Switch from the I/O option under the Libraries menu selection. onnections are made as described above. The input value of may be changed by clicking the mouse on the switch. Probe: The value of an input or an output may be determined by using a Probe. The Probe selection appears in the I/O option. onnect probes to points,, and. The completed circuit is shown in IGURE 47 for two input value sets. The arrow switch options may be used to rotate a probe as shown by Probe2 below. Pr obe NND NND2 Pr obe3 Pr obe2 Pr obe NND NND2 Pr obe3 Pr obe2 IGURE 47. The completed circuit. 23

24 REERENES [] Huges, John L., Digital omputer Lab Workbook, Digital Equipment orporation, 969. [2] Kohavi, Zvi, Switching and inite utomata Theory, McGraw-Hill, 97, hapters 3, 4, 5, and 9. [3] Mowle,. W., Systematic pproach to Digital Logic Design, ddison Wesley, 976, hapters 3, 4, 5, 8, and 9. 24

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design PH-315 COMINATIONAL and SEUENTIAL LOGIC CIRCUITS Hardware implementation and software design A La Rosa I PURPOSE: To familiarize with combinational and sequential logic circuits Combinational circuits

More information

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction

More information

CHAPTER 3 Boolean Algebra and Digital Logic

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

Lecture 8: Synchronous Digital Systems

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

BOOLEAN ALGEBRA & LOGIC GATES

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

Digital Electronics Detailed Outline

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

Counters and Decoders

Counters and Decoders Physics 3330 Experiment #10 Fall 1999 Purpose Counters and Decoders In this experiment, you will design and construct a 4-bit ripple-through decade counter with a decimal read-out display. Such a counter

More information

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. Objectives Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. describe how such a flip-flop can be SET and RESET. describe the disadvantage

More information

Counters. Present State Next State A B A B 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0

Counters. Present State Next State A B A B 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0 ounter ounters ounters are a specific type of sequential circuit. Like registers, the state, or the flip-flop values themselves, serves as the output. The output value increases by one on each clock cycle.

More information

Module 3: Floyd, Digital Fundamental

Module 3: Floyd, Digital Fundamental Module 3: Lecturer : Yongsheng Gao Room : Tech - 3.25 Email : yongsheng.gao@griffith.edu.au Structure : 6 lectures 1 Tutorial Assessment: 1 Laboratory (5%) 1 Test (20%) Textbook : Floyd, Digital Fundamental

More information

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas Take-Home Exercise Assume you want the counter below to count mod-6 backward. That is, it would count 0-5-4-3-2-1-0, etc. Assume it is reset on startup, and design the wiring to make the counter count

More information

6. BOOLEAN LOGIC DESIGN

6. BOOLEAN LOGIC DESIGN 6. OOLEN LOGI DESIGN 89 Topics: oolean algebra onverting between oolean algebra and logic gates and ladder logic Logic examples Objectives: e able to simplify designs with oolean algebra 6. INTRODUTION

More information

BINARY CODED DECIMAL: B.C.D.

BINARY CODED DECIMAL: B.C.D. BINARY CODED DECIMAL: B.C.D. ANOTHER METHOD TO REPRESENT DECIMAL NUMBERS USEFUL BECAUSE MANY DIGITAL DEVICES PROCESS + DISPLAY NUMBERS IN TENS IN BCD EACH NUMBER IS DEFINED BY A BINARY CODE OF 4 BITS.

More information

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.

More information

CS311 Lecture: Sequential Circuits

CS311 Lecture: Sequential Circuits CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce

More information

Lesson 12 Sequential Circuits: Flip-Flops

Lesson 12 Sequential Circuits: Flip-Flops Lesson 12 Sequential Circuits: Flip-Flops 1. Overview of a Synchronous Sequential Circuit We saw from last lesson that the level sensitive latches could cause instability in a sequential system. This instability

More information

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Systems I: omputer Organization and Architecture Lecture 8: Registers and ounters Registers A register is a group of flip-flops. Each flip-flop stores one bit of data; n flip-flops are required to store

More information

(Refer Slide Time: 00:01:16 min)

(Refer Slide Time: 00:01:16 min) Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control

More information

The components. E3: Digital electronics. Goals:

The components. E3: Digital electronics. Goals: E3: Digital electronics Goals: Basic understanding of logic circuits. Become familiar with the most common digital components and their use. Equipment: 1 st. LED bridge 1 st. 7-segment display. 2 st. IC

More information

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs. equential Logic o far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs. In sequential logic the output of the

More information

DIGITAL COUNTERS. Q B Q A = 00 initially. Q B Q A = 01 after the first clock pulse.

DIGITAL COUNTERS. Q B Q A = 00 initially. Q B Q A = 01 after the first clock pulse. DIGITAL COUNTERS http://www.tutorialspoint.com/computer_logical_organization/digital_counters.htm Copyright tutorialspoint.com Counter is a sequential circuit. A digital circuit which is used for a counting

More information

DEPARTMENT OF INFORMATION TECHNLOGY

DEPARTMENT OF INFORMATION TECHNLOGY DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453

More information

Karnaugh Maps (K-map) Alternate representation of a truth table

Karnaugh Maps (K-map) Alternate representation of a truth table Karnaugh Maps (K-map) lternate representation of a truth table Red decimal = minterm value Note that is the MS for this minterm numbering djacent squares have distance = 1 Valuable tool for logic minimization

More information

Lab 1: Full Adder 0.0

Lab 1: Full Adder 0.0 Lab 1: Full Adder 0.0 Introduction In this lab you will design a simple digital circuit called a full adder. You will then use logic gates to draw a schematic for the circuit. Finally, you will verify

More information

3.Basic Gate Combinations

3.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 information

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies ETEC 2301 Programmable Logic Devices Chapter 10 Counters Shawnee State University Department of Industrial and Engineering Technologies Copyright 2007 by Janna B. Gallaher Asynchronous Counter Operation

More information

Sum-of-Products and Product-of-Sums expressions

Sum-of-Products and Product-of-Sums expressions Sum-of-Products and Product-of-Sums expressions This worksheet and all related files are licensed under the reative ommons ttribution License, version.. To view a copy of this license, visit http://creativecommons.org/licenses/by/./,

More information

To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC.

To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC. 8.1 Objectives To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC. 8.2 Introduction Circuits for counting events are frequently used in computers and other digital

More information

Digital Logic Elements, Clock, and Memory Elements

Digital Logic Elements, Clock, and Memory Elements Physics 333 Experiment #9 Fall 999 Digital Logic Elements, Clock, and Memory Elements Purpose This experiment introduces the fundamental circuit elements of digital electronics. These include a basic set

More information

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

More information

7. Latches and Flip-Flops

7. Latches and Flip-Flops Chapter 7 Latches and Flip-Flops Page 1 of 18 7. Latches and Flip-Flops Latches and flip-flops are the basic elements for storing information. One latch or flip-flop can store one bit of information. The

More information

Understanding Logic Design

Understanding Logic Design Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1

More information

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

1. 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 information

Elementary Logic Gates

Elementary Logic Gates Elementary Logic Gates Name Symbol Inverter (NOT Gate) ND Gate OR Gate Truth Table Logic Equation = = = = = + C. E. Stroud Combinational Logic Design (/6) Other Elementary Logic Gates NND Gate NOR Gate

More information

Asynchronous counters, except for the first block, work independently from a system clock.

Asynchronous counters, except for the first block, work independently from a system clock. Counters Some digital circuits are designed for the purpose of counting and this is when counters become useful. Counters are made with flip-flops, they can be asynchronous or synchronous and they can

More information

ASYNCHRONOUS COUNTERS

ASYNCHRONOUS COUNTERS LB no.. SYNCHONOUS COUNTES. Introduction Counters are sequential logic circuits that counts the pulses applied at their clock input. They usually have 4 bits, delivering at the outputs the corresponding

More information

Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

More information

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language Chapter 4 Register Transfer and Microoperations Section 4.1 Register Transfer Language Digital systems are composed of modules that are constructed from digital components, such as registers, decoders,

More information

Counters are sequential circuits which "count" through a specific state sequence.

Counters are sequential circuits which count through a specific state sequence. Counters Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences. Two distinct types are in common usage:

More information

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa Experiment # 9 Clock generator circuits & Counters Eng. Waleed Y. Mousa 1. Objectives: 1. Understanding the principles and construction of Clock generator. 2. To be familiar with clock pulse generation

More information

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

More information

EE360: Digital Design I Course Syllabus

EE360: 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 information

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw. Sequential Circuit

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw. Sequential Circuit Modeling Sequential Elements with Verilog Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw 4-1 Sequential Circuit Outputs are functions of inputs and present states of storage elements

More information

Theory of Logic Circuits. Laboratory manual. Exercise 3

Theory of Logic Circuits. Laboratory manual. Exercise 3 Zakład Mikroinformatyki i Teorii Automatów yfrowych Theory of Logic ircuits Laboratory manual Exercise 3 Bistable devices 2008 Krzysztof yran, Piotr zekalski (edt.) 1. lassification of bistable devices

More information

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

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 2. LECTURE: ELEMENTARY SEUENTIAL CIRCUITS: FLIP-FLOPS 1st year BSc course 2nd (Spring) term 2012/2013 1

More information

Figure 8-1 Four Possible Results of Adding Two Bits

Figure 8-1 Four Possible Results of Adding Two Bits CHPTER EIGHT Combinational Logic pplications Thus far, our discussion has focused on the theoretical design issues of computer systems. We have not yet addressed any of the actual hardware you might find

More information

Design: a mod-8 Counter

Design: a mod-8 Counter Design: a mod-8 Counter A mod-8 counter stores a integer value, and increments that value (say) on each clock tick, and wraps around to 0 if the previous stored value was 7. So, the stored value follows

More information

Binary Adders: Half Adders and Full Adders

Binary Adders: Half Adders and Full Adders Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order

More information

2.0 Chapter Overview. 2.1 Boolean Algebra

2.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 information

Reading 13 : Finite State Automata and Regular Expressions

Reading 13 : Finite State Automata and Regular Expressions CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

More information

CHAPTER 11: Flip Flops

CHAPTER 11: Flip Flops CHAPTER 11: Flip Flops In this chapter, you will be building the part of the circuit that controls the command sequencing. The required circuit must operate the counter and the memory chip. When the teach

More information

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 24 p. 1/20 EE 42/100 Lecture 24: Latches and Flip Flops ELECTRONICS Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad University of California,

More information

Sequential Logic Design Principles.Latches and Flip-Flops

Sequential Logic Design Principles.Latches and Flip-Flops Sequential Logic Design Principles.Latches and Flip-Flops Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Bistable Elements Latches and Flip-Flops S-R Latch

More information

Flip-Flops, Registers, Counters, and a Simple Processor

Flip-Flops, Registers, Counters, and a Simple Processor June 8, 22 5:56 vra235_ch7 Sheet number Page number 349 black chapter 7 Flip-Flops, Registers, Counters, and a Simple Processor 7. Ng f3, h7 h6 349 June 8, 22 5:56 vra235_ch7 Sheet number 2 Page number

More information

Two's Complement Adder/Subtractor Lab L03

Two's Complement Adder/Subtractor Lab L03 Two's Complement Adder/Subtractor Lab L03 Introduction Computers are usually designed to perform indirect subtraction instead of direct subtraction. Adding -B to A is equivalent to subtracting B from A,

More information

Upon completion of unit 1.1, students will be able to

Upon completion of unit 1.1, students will be able to Upon completion of unit 1.1, students will be able to 1. Demonstrate safety of the individual, class, and overall environment of the classroom/laboratory, and understand that electricity, even at the nominal

More information

Asynchronous Counters. Asynchronous Counters

Asynchronous Counters. Asynchronous Counters Counters and State Machine Design November 25 Asynchronous Counters ENGI 25 ELEC 24 Asynchronous Counters The term Asynchronous refers to events that do not occur at the same time With respect to counter

More information

Contents COUNTER. Unit III- Counters

Contents COUNTER. Unit III- Counters COUNTER Contents COUNTER...1 Frequency Division...2 Divide-by-2 Counter... 3 Toggle Flip-Flop...3 Frequency Division using Toggle Flip-flops...5 Truth Table for a 3-bit Asynchronous Up Counter...6 Modulo

More information

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute. 2nd (Spring) term 2012/2013

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute. 2nd (Spring) term 2012/2013 DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COUNTERS AND RELATED 2nd (Spring) term 2012/2013 1 4. LECTURE: COUNTERS AND RELATED 1. Counters,

More information

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1)

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1) IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1) Elena Dubrova KTH / ICT / ES dubrova@kth.se BV pp. 584-640 This lecture IE1204 Digital Design, HT14 2 Asynchronous Sequential Machines

More information

Programming A PLC. Standard Instructions

Programming A PLC. Standard Instructions Programming A PLC STEP 7-Micro/WIN32 is the program software used with the S7-2 PLC to create the PLC operating program. STEP 7 consists of a number of instructions that must be arranged in a logical order

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

WEEK 8.1 Registers and Counters. ECE124 Digital Circuits and Systems Page 1

WEEK 8.1 Registers and Counters. ECE124 Digital Circuits and Systems Page 1 WEEK 8.1 egisters and Counters ECE124 igital Circuits and Systems Page 1 Additional schematic FF symbols Active low set and reset signals. S Active high set and reset signals. S ECE124 igital Circuits

More information

Sequential Logic: Clocks, Registers, etc.

Sequential Logic: Clocks, Registers, etc. ENEE 245: igital Circuits & Systems Lab Lab 2 : Clocks, Registers, etc. ENEE 245: igital Circuits and Systems Laboratory Lab 2 Objectives The objectives of this laboratory are the following: To design

More information

2 : BISTABLES. In this Chapter, you will find out about bistables which are the fundamental building blocks of electronic counting circuits.

2 : BISTABLES. In this Chapter, you will find out about bistables which are the fundamental building blocks of electronic counting circuits. 2 : BITABLE In this Chapter, you will find out about bistables which are the fundamental building blos of electronic counting circuits. et-reset bistable A bistable circuit, also called a latch, or flip-flop,

More information

ENEE 244 (01**). Spring 2006. Homework 5. Due back in class on Friday, April 28.

ENEE 244 (01**). Spring 2006. Homework 5. Due back in class on Friday, April 28. ENEE 244 (01**). Spring 2006 Homework 5 Due back in class on Friday, April 28. 1. Fill up the function table (truth table) for the following latch. How is this latch related to those described in the lectures

More information

Operating Manual Ver.1.1

Operating Manual Ver.1.1 4 Bit Binary Ripple Counter (Up-Down Counter) Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94-101, Electronic Complex Pardesipura, Indore- 452010, India Tel : 91-731- 2570301/02, 4211100 Fax: 91-731-

More information

Digital Logic Design Sequential circuits

Digital Logic Design Sequential circuits Digital Logic Design Sequential circuits Dr. Eng. Ahmed H. Madian E-mail: ahmed.madian@guc.edu.eg Dr. Eng. Rania.Swief E-mail: rania.swief@guc.edu.eg Dr. Eng. Ahmed H. Madian Registers An n-bit register

More information

CHAPTER 11 LATCHES AND FLIP-FLOPS

CHAPTER 11 LATCHES AND FLIP-FLOPS CHAPTER 11 LATCHES AND FLIP-FLOPS This chapter in the book includes: Objectives Study Guide 11.1 Introduction 11.2 Set-Reset Latch 11.3 Gated D Latch 11.4 Edge-Triggered D Flip-Flop 11.5 S-R Flip-Flop

More information

CHAPTER IX REGISTER BLOCKS COUNTERS, SHIFT, AND ROTATE REGISTERS

CHAPTER IX REGISTER BLOCKS COUNTERS, SHIFT, AND ROTATE REGISTERS CHAPTER IX-1 CHAPTER IX CHAPTER IX COUNTERS, SHIFT, AN ROTATE REGISTERS REA PAGES 249-275 FROM MANO AN KIME CHAPTER IX-2 INTROUCTION -INTROUCTION Like combinational building blocks, we can also develop

More information

Digital Fundamentals. Lab 8 Asynchronous Counter Applications

Digital Fundamentals. Lab 8 Asynchronous Counter Applications Richland College Engineering Technology Rev. 0 B. Donham Rev. 1 (7/2003). Horne Rev. 2 (1/2008). Bradbury Digital Fundamentals CETT 1425 Lab 8 Asynchronous Counter Applications Name: Date: Objectives:

More information

DIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department

DIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department Counters By: Electrical Engineering Department 1 Counters Upon completion of the chapter, students should be able to:.1 Understand the basic concepts of asynchronous counter and synchronous counters, and

More information

Jianjian Song LogicWorks 4 Tutorials (5/15/03) Page 1 of 14

Jianjian Song LogicWorks 4 Tutorials (5/15/03) Page 1 of 14 LogicWorks 4 Tutorials Jianjian Song Department of Electrical and Computer Engineering Rose-Hulman Institute of Technology March 23 Table of Contents LogicWorks 4 Installation and update...2 2 Tutorial

More information

Lecture-3 MEMORY: Development of Memory:

Lecture-3 MEMORY: Development of Memory: Lecture-3 MEMORY: It is a storage device. It stores program data and the results. There are two kind of memories; semiconductor memories & magnetic memories. Semiconductor memories are faster, smaller,

More information

CAs and Turing Machines. The Basis for Universal Computation

CAs and Turing Machines. The Basis for Universal Computation CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.

More information

Lab 11 Digital Dice. Figure 11.0. Digital Dice Circuit on NI ELVIS II Workstation

Lab 11 Digital Dice. Figure 11.0. Digital Dice Circuit on NI ELVIS II Workstation Lab 11 Digital Dice Figure 11.0. Digital Dice Circuit on NI ELVIS II Workstation From the beginning of time, dice have been used for games of chance. Cubic dice similar to modern dice date back to before

More information

Chapter 2 Logic Gates and Introduction to Computer Architecture

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

ELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits

ELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits Objectives ELEC - EXPERIMENT Basic Digital Logic Circuits The experiments in this laboratory exercise will provide an introduction to digital electronic circuits. You will learn how to use the IDL-00 Bit

More information

Ladder and Functional Block Programming

Ladder and Functional Block Programming CHPTER 11 Ladder and Functional lock Programming W. olton This (and the following) chapter comes from the book Programmable Logic Controllers by W. olton, ISN: 9780750681124. The first edition of the book

More information

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1 United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.

More information

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

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

Flip-Flops and Sequential Circuit Design. ECE 152A Winter 2012

Flip-Flops and Sequential Circuit Design. ECE 152A Winter 2012 Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6

More information

Flip-Flops and Sequential Circuit Design

Flip-Flops and Sequential Circuit Design Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6

More information

Introduction to LogixPro - Lab

Introduction to LogixPro - Lab Programmable Logic and Automation Controllers Industrial Control Systems I Introduction to LogixPro - Lab Purpose This is a self-paced lab that will introduce the student to the LogixPro PLC Simulator

More information

2011, The McGraw-Hill Companies, Inc. Chapter 5

2011, The McGraw-Hill Companies, Inc. Chapter 5 Chapter 5 5.1 Processor Memory Organization The memory structure for a PLC processor consists of several areas, some of these having specific roles. With rack-based memory structures addresses are derived

More information

Memory Elements. Combinational logic cannot remember

Memory Elements. Combinational logic cannot remember Memory Elements Combinational logic cannot remember Output logic values are function of inputs only Feedback is needed to be able to remember a logic value Memory elements are needed in most digital logic

More information

MICROPROCESSOR AND MICROCOMPUTER BASICS

MICROPROCESSOR AND MICROCOMPUTER BASICS Introduction MICROPROCESSOR AND MICROCOMPUTER BASICS At present there are many types and sizes of computers available. These computers are designed and constructed based on digital and Integrated Circuit

More information

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated

More information

Chapter 7. Registers & Register Transfers. J.J. Shann. J. J. Shann

Chapter 7. Registers & Register Transfers. J.J. Shann. J. J. Shann Chapter 7 Registers & Register Transfers J. J. Shann J.J. Shann Chapter Overview 7- Registers and Load Enable 7-2 Register Transfers 7-3 Register Transfer Operations 7-4 A Note for VHDL and Verilog Users

More information

Chapter 9 Latches, Flip-Flops, and Timers

Chapter 9 Latches, Flip-Flops, and Timers ETEC 23 Programmable Logic Devices Chapter 9 Latches, Flip-Flops, and Timers Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Latches A temporary

More information

Decimal Number (base 10) Binary Number (base 2)

Decimal Number (base 10) Binary Number (base 2) LECTURE 5. BINARY COUNTER Before starting with counters there is some vital information that needs to be understood. The most important is the fact that since the outputs of a digital chip can only be

More information

Chapter. Getting Started. In This Chapter...

Chapter. Getting Started. In This Chapter... Getting Started hapter In This hapter... Introduction... Purpose of this Manual... bout Getting Started... Online Help Files and Other ocumentation... Technical Support... onventions Used... Key Topics

More information

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

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

Combinational Logic Design Process

Combinational Logic Design Process Combinational Logic Design Process Create truth table from specification Generate K-maps & obtain logic equations Draw logic diagram (sharing common gates) Simulate circuit for design verification Debug

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is

More information

Counters & Shift Registers Chapter 8 of R.P Jain

Counters & Shift Registers Chapter 8 of R.P Jain Chapter 3 Counters & Shift Registers Chapter 8 of R.P Jain Counters & Shift Registers Counters, Syllabus Design of Modulo-N ripple counter, Up-Down counter, design of synchronous counters with and without

More information

Copyright Peter R. Rony 2009. All rights reserved.

Copyright Peter R. Rony 2009. All rights reserved. Experiment No. 1. THE DIGI DESIGNER Experiment 1-1. Socket Connections on the Digi Designer Experiment No. 2. LOGIC LEVELS AND THE 7400 QUADRUPLE 2-INPUT POSITIVE NAND GATE Experiment 2-1. Truth Table

More information

Latches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012

Latches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012 Latches, the D Flip-Flop & Counter Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7. Basic Latch 7.2 Gated SR Latch 7.2. Gated SR

More information