1 Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs Sequential circuits, however, act as storage elements and have memory. to store, retain, and then retrieve information when needed at a later time. Block diagram of a sequential circuit: present state next state A combinational circuit with memory elements forming a feedback path. The binary information stored in memory defines the state. Outputs are determined by Inputs and present state. Next state is also determined by Inputs and present state.
2 Synchronous vs. Asychronous NCNU_2016_DD_5_2 There are two main types of sequential circuits: synchronous and asynchronous. The behavior of a synchronous sequential circuit can be defined from the knowledge of its signals at discrete instants of time. The behavior of an asynchronous sequential circuit depends upon the input signals at any instant of time and the order in which the inputs change. The storage elements commonly used in asynchronous sequential circuits are time-delay devices. Thus, an asynchronous sequential circuit may be regarded as a combinational circuit with feedback (no actual storage elements are necessary). Asynchronous sequential circuit may become unstable at times, imposing many difficulties on the designer, and will not be covered in this course.
3 Clocked Sequential Circuits NCNU_2016_DD_5_3 Synchronous sequential circuits affect the storage elements at only discrete instants of time. A clock generator performs the synchronization, which provides a clock signal having a periodic train of clock pulses, commonly denoted as clock or clk. The storage elements are affected only with the arrival of each clock pulse. In practice, the clock pulses determine when computational activity will occur within the circuit, and other signals (external inputs and otherwise) determine what changes will take place affecting the storage elements and the outputs. Synchronous sequential circuits that use clock pulses to control storage elements are called clocked sequential circuits and are the type most frequently encountered in practice; also called synchronous circuits because the activity within the circuit and the resulting updating of stored values is synchronized to the clock pulses. The design of synchronous circuits is feasible because they seldom manifest instability problems and their timing is easily broken down into independent discrete steps, each of which can be considered separately. Design system with synchronous circuits as you can.
4 Filp-Flops as Storage Elements NCNU_2016_DD_5_4 Flip-flops (FF), 1-bit memory, are used as the basic storage elements. A sequential circuit may use many flip-flops to store as many bits as necessary. The output of a flip-flop is either 0 or 1 (two states). The outputs (and next states) are combinational logic function of the inputs to the circuit and/or the values stored in the flip-flops (the previous states). The new value is stored (updated) in flip-flop when the clock pulse occurs. present states next states
5 Clock Synchronization NCNU_2016_DD_5_5 The next value of the flip-flops must have reached a stable value before the occurrence of the clock pulse, consequently, the combinational logic must respond to a change in the state of the flip-flops in time to be updated before the next clock pulse arrives. Propagation delay of the combinational logic determines the minimum interval between clock pulses to allow the circuit to operate correctly. The state of the flip-flops changes only by a clock pulse transition for example, when the value of the clock signals changes from 0 to 1 (positive edge). If the clock pulse is not active, the input and output of the flip-flop is effectively isolated; flip-flop can be regarded as two gates controlled complementarily. Thus, the transition from one state to the next occurs only at predetermined intervals dictated by the clock pulses, that is so called synchronization. Storage elements that operate with signal levels (rather than signal transitions) are referred to as latches; those controlled by a clock transition are flip-flops. Latches are said to be level sensitive devices; flip-flops are edge-sensitive ones. For design simply and function correctly, use flip-flops as possible as you can.
6 5-3 Latches NCNU_2016_DD_5_6 The SR latch has two cross-coupled NOR gates (or two cross-coupled NAND gates) and two inputs labeled with S for set and R for reset. When output Q = 1 and Q = 0, the latch is said to be in the set state, and Q = 0 and Q = 1, is in the reset state. Forbidden state: Inputs Q and Q are normally the complement of each other When both inputs are 1 at the same time result both outputs equal to 0 If both inputs then change to 0 simultaneously, the device will enter an unpredictable or undefined state or a metastable state The unpredictable state will depend on the order in which S and R return to 0. Q Q
7 SR Latch with NAND Gates NCNU_2016_DD_5_7 Both inputs are normally at 1. Input 0 to the S (R) causes Q (Q ) to be 1, putting the latch in the set (reset) state. The forbidden condition is both inputs being 0 at the same time. The NAND latch is low activated (active low). 0 x 0 1 Q Q 0 x 1 1 Q Q 1 x 1 0 Q Q Q Q 1 x 0 0 Q 0 disables AND, 1 enables AND 0 enables OR, 1 disables OR Q
8 SR Latch with Enable NCNU_2016_DD_5_8
9 D Latch (Transparent Latch) NCNU_2016_DD_5_9 Ensure S and R are never equal to 1 at the same time to eliminate the undesirable condition of the indeterminate state in the SR latch. As En is at 0, the cross-coupled SR latch has both inputs at 1 and the circuit cannot change state regardless of the value of D. Transparent: as En = 1, Q (Q ) follows the change of D When En transits from 1 to 0, the binary information at D at the transition time is retained (i.e., stored) at Q until En raises to 1 again. Q Q Characteristic equation: Q(t+1) = D regard En as the Clk signal transparent
10 Trigger Trigger: a latch or flip-flop is switched by a change of the control input Level triggered latches Edge triggered flip-flops NCNU_2016_DD_5_10 race 1 The transparent latch (level sensitive) may fail due to a race condition. The state of a latch changes as soon as the clock changes to 1, and the new state appears at the output while the clock is still active (due to transparent). This output may race through the combinational circuit to the latch input. If the clock is still active, the latch will respond to the new value again and a new output state may occur resulting an unpredictable situation. To avoid race, the output of a latch cannot be applied directly or through combinational logic to the input of the same or another latch when all the latches are triggered by a common clock source.
11 Master slave D Flip-flop NCNU_2016_DD_5_11 D flip-flop consists of two D latches and an inverter, the first latch is called the master and the second the slave. The two latches are controlled (enabled) complementarily; they flip and flop alternatively. Samples D and changes Q only at the negative edge of the clock (Clk), the transition of the clock from 1 to 0. Positive edge triggered D flip-flop can also be constructed by adding an inverter to the Clk input. Clk D latch Clk
12 D-type Positive-edge-triggered Flip-flop NCNU_2016_DD_5_12 A more compact realization. Two latches respond to the D (data) and Clk (clock) inputs, and the third latch provides the outputs for the flip-flop. 1 If Clk = 0 S = R = 1, Q unchanged. If D = 0 when Clk becomes 1 R = 0 Q = 0. Then any change in D while Clk = 1 R remains 0 does not affect the output Q (Q ) Similarly. If D = 1 when Clk becomes 1 S = 0 Q = 1. Then any change in D while Clk = 1 S remains 0 does not affect the output Q (Q ). The output only responds to the positive edge of Clk.
13 Timing Parameters NCNU_2016_DD_5_13 Setup time D input must be maintained at a constant value prior to the application of the positiveedge of Clk pulse (rise) equal to the propagation delay through gates 4 and 1 data to the internal latches Hold time D input must not changes after the application of the positive Clk pulse equal to the propagation delay of gate 3 clock to the internal latch Clk Propagation delays, clock to output. D setup hold
14 Graphic Symbols NCNU_2016_DD_5_14 Latch Edge-triggered D flip-flop - low active - edge triggered
15 JK Flip-Flop NCNU_2016_DD_5_15 Edge-triggered D flip-flop requires the smallest number of gates, and is the most economical and efficient flip-flop constructed in VLSI IC design. Other types of flip-flops can be constructed by D flip-flop and external logic. JK and T flip-flops are two other used flip-flops. JK flip-flop: (to avoid the forbidden indeterminate state) D = JQ + K Q Characteristic equation: Q(t+1) = JQ + K Q J K Q(t) Q(t+1)
16 T Flip-Flop NCNU_2016_DD_5_16 T (toggle) flip-flop can be obtained from a JK flip-flop with J and K tied together. Can also be constructed with a D flip-flop and an exclusive-or gate. D = T Q = TQ + T Q Characteristic equation: Q(t+1) = TQ + T Q Useful for designing binary counters. T Q(t) Q(t+1)
17 Asynchronous Inputs NCNU_2016_DD_5_17 The state of the flip-flops is unknown when power is turned on. Asynchronous inputs are used to force the flip-flop to a known starting state (initialization) independently of the clock. Preset or direct set sets the flip-flop to 1. Clear or direct reset clears the flip-flop to 0. D flip-flop with asynchronous reset: 1 1
18 NCNU_2016_DD_5_18 Positive Edge-triggered D-FF with Preset and Clear 74HC74 dual D flip-flop
19 5-5 Analysis of Clocked Sequential Ckts NCNU_2016_DD_5_19 Analysis describes what a circuit will do under certain operating conditions. For clocked sequential circuits, the outputs and the next state are both a function of the inputs and the present state. The analysis of a sequential circuit consists of obtaining a state table or a state diagram for the time sequence of inputs, outputs, and internal states. Boolean expressions can also describe the behavior of the sequential circuit. A logic diagram is recognized as a clocked sequential circuit if it includes flip-flops with clock inputs. The flip-flops may be of any type (D, JK, T), and the logic diagram may or may not include combinational logic gates.
20 NCNU_2016_DD_5_20 State Equations The behavior of a clocked sequential circuit can be described algebraically by means of state equations; also called transition equations, specifies the next state as a function of the present state and inputs. Example: 0-detector two D flip-flops A and B, an input x and output y State equations: A(t + 1) = A(t)x(t) + B(t)x(t) B(t + 1) = A (t)x(t) t: Present time t+1: Next time Output: y(t) = [A(t) + B(t)]x (t)
21 State Table NCNU_2016_DD_5_21 State table (also called a transition table) enumerates the time sequence of inputs, outputs, and flip-flop states. The table consists of four labels: present state, input, next state, and output. List all possible binary combinations of present states and inputs. State equations are derived as: A(t + 1) = Ax + Bx B(t + 1) = A x Output equation: y = (A + B)x similar to a truth table Also can be expressed with flip-flop input equations: D A = Ax + Bx D B = A x y = (A + B)x
22 Second Form of State Table NCNU_2016_DD_5_22 In general, a sequential circuit with m flip-flops and n inputs needs 2 m+n rows in the state table. A second from of state table uses only three labels: present state, next state, and output; and the input conditions are enumerated under the next-state and output sections. similar to a K-map
23 State Diagram NCNU_2016_DD_5_23 Graphical representation of a state table Well matched with the second form of state table Each circle represents an assigned state Directed lines, indicate a state transition, are labeled with input/output In this example, every circle (state) has two outgoing directed lines to other circles A directed line connecting a circle with itself indicates that no change of state occurs. The analysis steps are summarized as: circuit equations state table state diagram
24 Analysis with D Flip-flops NCNU_2016_DD_5_24 A sequential circuit with state equation: D A = A x y D A : D flip-flop with output A; x and y: inputs; and no output given. For a D flip-flop, the state equation is the same as the input equation. One flip-flop has two states. Two inputs have four possible combinations for each state.
25 Analysis with JK Flip-flops NCNU_2016_DD_5_25 The next-state values of JK or T flip-flops can be derived as follows: 1. Determine the flip-flop input equations in terms of the present state and input variables. 2. List the binary values of each input equation. 3. Use the corresponding flip-flop characteristic table to determine the next-state values in the state table. The flip-flop input equations J A = B K A = Bx J B = x K B = A x + Ax = A x
26 NCNU_2016_DD_5_26 J A = B, K A = Bx J B = x, K B = A x + Ax = A x The above equations determine the flip-flop inputs to derive the next state Or, derive the state equations using characteristic eq.
27 Using Characteristic Equations NCNU_2016_DD_5_27 Characteristic equation of JK FF: Q(t+1) = JQ + K Q So for the two JK FFs A(t + 1) = J A A + K A A, B(t + 1) = J B B + K B B Substituting the values of J A, K A, J B, and K B A(t + 1) = BA + (Bx ) A= A B + AB + Ax B(t + 1) = x B + (A x) B = B x + ABx + A Bx The Next state can be derived from the above two equations. State diagram: J A = B, K A = Bx J B = x, K B = A x + Ax = A x
28 Analysis with T Flip-flops NCNU_2016_DD_5_28 Example: two T flip-flops A and B, one input x, and one output y Two input equations and an output equation: T A = Bx T B = x y = AB
29 NCNU_2016_DD_5_29 Input equations and an output equation: T A = Bx, T B = x, y = AB Characteristic equation of T flip-flops: Q(t + 1) = T Q = T Q + TQ The values for the next state A(t + 1) = (Bx) A + (Bx)A = AB + Ax + A Bx B(t + 1) = x B
30 Finite State Machines (FSM) NCNU_2016_DD_5_30 A sequential circuit has inputs, outputs, and internal states. Two commonly used finite state machine models of sequential circuits, the Mealy model and the Moore model, differing only in the way the output is generated. The outputs of Moore circuit are synchronized with the clock, depend only on flip-flop outputs that are synchronized with the clock. The output of the Mealy machine is the value that is present immediately before the active edge of the clock.
31 5-7 State Reduction and Assignment NCNU_2016_DD_5_31 The design (synthesis) of a sequential circuit starts from a set of specifications and culminates in a logic diagram. Two sequential circuits may exhibit the same input output behavior (function), but have a different number of internal states in their state diagram. The current section discusses certain properties of sequential circuits that may simplify a design by reducing the number of gates and flip-flops it uses. In general, reducing the number of flip-flops reduces the cost of a circuit. State-reduction, reducing the number of states in a state table, while keeping the external input output requirements unchanged, can reduce the number of flip-flops used in a sequential circuit. Since m flip-flops produce 2 m states, a reduction in the number of states may (or may not) result in a reduction in the number of flip-flops. Reducing the number of flip-flops sometimes results the equivalent circuit with fewer flip-flops but more combinational gates to realize its next state and output logic.
32 State Reduction Example NCNU_2016_DD_5_32 Two circuits are equivalent if identical input sequences are applied to the two circuits and identical outputs occur for all input sequences, then one may be replaced by the other. State reduction reduces the number of states in a sequential circuit without altering the input output relationships. Only the input-output sequences are important in this example. Consider the input sequence starting from the initial state a. Complete the sequence to get the follows:
33 NCNU_2016_DD_5_33 State table is more convenient for state reduction than a diagram. State reduction algorithm: Two states are said to be equivalent if, for each member of the set of inputs, they give exactly the same output and send the circuit either to the same state or to an equivalent state. When two states are equivalent, one of them can be removed without altering the input output relationships. Back to the example: States e and g both go to states a and f and have outputs of 0 and 1 for x = 0 and x = 1, respectively. States g and e are equivalent, and one of these states can be removed. States f and d are also equivalent, so state f can be removed and replaced by d.
34 Original State Table NCNU_2016_DD_5_34
35 Reduced State Diagram NCNU_2016_DD_5_35
36 State Assignment NCNU_2016_DD_5_36 States must be assigned with unique coded binary values to implement the physical components. For a circuit with m states, the assigned codes must contain n bits, where 2 n m. Unused states (codes) are treated as don t-care conditions during the design. Don t-care conditions usually help in obtaining a simpler circuit. The simplest way to code states is to use binary counting code or Gray code without guaranteeing a better result. One-hot assignment, uses one flip-flop per state, ensures only one bit is equal to 1 while all others are kept at 0, usually leads to simpler decoding logic for the next state and output, results a faster machines, and the silicon area required by the extra flip-flops can be offset by the area saved by using simpler decoding logic.
37 Binary Assignment NCNU_2016_DD_5_37 A different assignment will result in a state table with different binary values for the states. The binary form of the state table is used to derive the next state and output --forming combinational logic part of the sequential circuit. The complexity of the combinational circuit depends on the binary state assignment chosen. Sometimes, the name transition table is used for a state table with a binary assignment. a b c d e A great many possible binary assignments may exist.
38 5-8 Design Procedure NCNU_2016_DD_5_38 A synchronous sequential circuit is made up of flip-flops and combinational gates. The design of the circuit consists of choosing the flip-flops and then finding a combinational gate structure that, together with the flip-flops, produces a circuit which fulfills the stated specifications. The design steps for synchronous sequential circuits can be summarized as: 1. From the word description and specifications of the desired operation, derive a state diagram for the circuit. 2. Reduce the number of states if necessary. 3. Assign binary values to the states. 4. Obtain the binary-coded state table. 5. Choose the type of flip-flops to be used. 6. Derive the simplified flip-flop input equations and output equations. 7. Draw the logic diagram.
39 Synthesis using D Flip-flops NCNU_2016_DD_5_39 Example: detect a sequence of three or more consecutive 1 s in a string of bits coming through an input line. x Clock Sequence Detector y Assign binary codes to the states and list the state table. Two D FFs (A and B) represent the four states, and one input x and one output y. S i : i consecutive 1 s is detected S 0 : starting state Moore FSM
40 NCNU_2016_DD_5_40 The characteristic equation of the D flip-flop is Q(t + 1) = D Q The flip-flop input equations can be obtained directly from the next-state columns of A and B and expressed in sum-of-minterms form as A(t + 1) = D A (A,B, x) = (3, 5, 7) B(t + 1) = D B (A,B, x) = (1, 5, 7) y(a,b, x) = (6, 7) The Boolean equations are simplified by K-maps: D A = Ax + Bx D B = Ax + B x y = AB
41 Logic Diagram of the Sequence Detector NCNU_2016_DD_5_41 D A = Ax + Bx D B = Ax + B x y = AB
42 Excitation Tables NCNU_2016_DD_5_42 The advantage of designing with D FFs is that the Boolean equations describing the inputs to the flip-flops can be obtained directly from the state table, the input equations are obtained directly from the next state. This is not the case for the JK and T types of flip-flops. T Q(t) Q(t+1) A state diagram flip-flop input functions straightforward for D flip-flops we need excitation tables for JK and T flip-flops a table that lists the required inputs for a given change of state. J K Q(t) Q(t+1)
43 Synthesis using JK Flip-flops NCNU_2016_DD_5_43 The same example + The state table and JK flip-flop inputs
44 K-Maps for JK Input Equations NCNU_2016_DD_5_44
45 Logic Diagram with JK Flip-flops NCNU_2016_DD_5_45 J A = Bx K A = Bx J B = x K B = (A x)
46 Synthesis using T Flip-flops NCNU_2016_DD_5_46 Example: n-bit binary counter consists of n flip-flops that can count in binary from 0 to 2 n - 1. The state diagram of a 3-bit counter is shown below, the input is the clock and the output is the state. A 2 A 1 A 0 3-bit Counter Clock
47 NCNU_2016_DD_5_47 Binary counters are constructed most efficiently with T flip-flops. Three flip-flops A 2, A 1, and A 0 are used. +
49 NCNU_2016_DD_5_49 Flip-Flop Applications: Parallel Data Storage A group of flip-flops can store several bits of data from parallel lines simultaneously. Parallel data lines connected to the D inputs of flip-flops. All the clock inputs of the flip-flops are connected together, so that all the flip-flops are triggered by the same clock pulse. CLR is for asynchronous reset. It is a basic register, will be covered in the next chapter.
50 Flip-Flop Applications: Frequency Division NCNU_2016_DD_5_50 The D flip-flop and J-K flip-flop as a divide-by-2 device. Two D flip-flops used to divide the clock frequency by 4.
51 Flip-Flop Applications: Counting NCNU_2016_DD_5_51 Two J-K flip-flops used to generate a binary count sequence (00, 01, 10, 11).
52 Homework #5 NCNU_2016_DD_5_ A sequential circuit with two D flip-flops A and B, two inputs, x and y ; and one output z is specified by the following next-state and output equations: A(t + 1) = xy + xb B(t + 1) = xa + xb z = A (a) Draw the logic diagram of the circuit. (b) List the state table for the sequential circuit. (c) Draw the corresponding state diagram. 5.8 Derive the state table and the state diagram of the sequential circuit shown below. Explain the function that the circuit performs.
53 NCNU_2016_DD_5_ A sequential circuit has two JK flip-flops A and B, two inputs x and y, and one output z. The flip-flop input equations and circuit output equation are JA = Bx + B y KA = B x + y JB = A x KB = A + xy z = (A + B)x y (a) Draw the logic diagram of the circuit. (b) Tabulate the state table. (c) Derive the state equations for A and B For the following state table (a) Draw the corresponding state diagram. (b) Tabulate the reduced state table. (c) Draw the state diagram corresponding to the reduced state table.
54 NCNU_2016_DD_5_ Design a sequential circuit with two D flip-flops A and B, and one input x_in. (a) When x_in = 0, the state of the circuit remains the same. When x_in = 1, the circuit goes through the state transitions from 00 to 01, to 11, to 10, back to 00, and repeats. (b) When x_in = 0, the state of the circuit remains the same. When x_in =1, the circuit goes through the state transitions from 00 to 11, to 01, to 10, back to 00, and repeats.
Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, firstname.lastname@example.org Dr. Eng. Wassim Alexan, email@example.com Lecture 6 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits 1 Sequential Circuits Introduction Composed of a combinational circuit to which the memory elements are connected to form a feedback
EE 25 Introduction to igital esign hapter 5 Sequential ircuits (5.1-5.4) Part 1 Storage Elements and Sequential ircuit Analysis Logic and omputer esign Fundamentals harles Kime & Thomas Kaminski 2008 Pearson
ection 6. equential Logic Flip-Flops Page of 5 6. equential Logic Flip-Flops ombinatorial components: their output values are computed entirely from their present input values. equential components: their
ELE2120 Digital Circuits and Systems Tutorial Note 7 Outline 1. Sequential Circuit 2. Gated SR Latch 3. Gated D-latch 4. Edge-Triggered D Flip-Flop 5. Asynchronous and Synchronous reset Sequential Circuit
Sequential Circuits: Latches & Flip-Flops Overview Storage Elements Latches SR, JK, D, and T Characteristic Tables, Characteristic Equations, Eecution Tables, and State Diagrams Standard Symbols Flip-Flops
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
CHAPTER 1 LATCHES & FLIP-FLOPS 1 Outcome After learning this chapter, student should be able to; Recognize the difference between latches and flipflops Analyze the operation of the flip flop Draw the output
Problems with -Latch If changes while is true, the new value of will appear at the output. The latch is transparent. If the stored value can change state more than once during a single clock pulse, the
Experiment 8 Introduction to Latches and Flip-Flops and registers Introduction: The logic circuits that have been used until now were combinational logic circuits since the output of the device depends
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited April 2, 2013 John Wawrzynek Spring 2013 EECS150 - Lec19-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
1 The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of the AND gate, you get the NAND gate etc. 2 One of the
ME262 Introduction to Microprocessor & Digital Logic (Sequential Logic) Summer 2 Sequential Logic Definition The output(s) of a sequential circuit depends d on the current and past states of the inputs,
Sequential Logic and Clocked Circuits Clock or Timing Device Input Variables State or Memory Element Combinational Logic Elements From combinational logic, we move on to sequential logic. Sequential logic
Chapter 4 Logic Design 4.1 Introduction. In previous Chapter we studied gates and combinational circuits, which made by gates (AND, OR, NOT etc.). That can be represented by circuit diagram, truth table
pp. 4-9 Krishi Sanskriti Publications http://www.krishisanskriti.org/jbaer.html Review of Flip-Flop Divya Aggarwal Student, Department of Physics and Astro-Physics, University of Delhi, New Delhi Abstract:
UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers. Digital computer is a digital system that performs various computational tasks. The word DIGITAL
Asynchronous Preset and Clear Inputs The S-R, J-K and D inputs are known as synchronous inputs because the outputs change when appropriate input values are applied at the inputs and a clock signal is applied
DIGITAL SYSTEM DESIGN UNIT I (2 MARKS) 1. Convert Binary number (111101100) 2 to Octal equivalent. 2. Convert Binary (1101100010011011) 2 to Hexadecimal equivalent. 3. Simplify the following Boolean function
EEE 304 Experiment No. 07 Name Of The Experiment: Sequential circuit design Latch, Flip-flop and Registers Important: Submit your Prelab at the beginning of the lab. Prelab 1: Construct a S-R Latch and
LAB #4 SEQUENTIAL LOGIC CIRCUIT OBJECTIVES 1. To learn how basic sequential logic circuit works 2. To test and investigate the operation of various latch and flip flop circuits INTRODUCTIONS Sequential
ESE 570 STATIC SEQUENTIAL CMOS LOGIC CELLS 1 Classes of Logic Circuits two stable op. pts. Latch level triggered. Flip-Flop edge triggered. one stable op. pt. One-shot single pulse output no stable op.
Flip-Flops Last time, we saw how latches can be used as memory in a circuit Latches introduce new problems: We need to know when to enable a latch We also need to quickly disable a latch In other words,
Digital Fundamentals: A Systems Approach Counters Chapter 8 A System: Digital Clock Digital Clock: Counter Logic Diagram Digital Clock: Hours Counter & Decoders Finite State Machines Moore machine: One
EE 2449 Experiment JL and NWP //8 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT SEQUENTIAL CIRCUITS Text: Mano and Ciletti,
EXPERIMENT: 1 DATE: VERIFICATION OF BASIC LOGIC GATES AIM: To verify the truth tables of Basic Logic Gates NOT, OR, AND, NAND, NOR, Ex-OR and Ex-NOR. APPARATUS: mention the required IC numbers, Connecting
Section I: Digital System Analysis and Review CEG 36/56; EE 45/65 Digital System Design Dr. Travis Doom, Assistant Professor Department of Computer Science and Engineering Wright State University Thanks
FE REVIEW LOGIC The AD gate f A, B AB The AD gates output will achieve its active state, ACTIVE HIGH, when BOTH of its inputs achieve their active state, ACTIVE E HIGH. A B AB f ( A, B) AB m (3) The OR
Logic Circuits gate is a circuit element that operates on a binary signal. Logic operations typically have three methods of description:. Equation symbol 2. Truth table 3. Circuit symbol The binary levels
Report on 4-bit Counter design Report- 1, 2. Report on D- Flipflop Course project for ECE533 I. Objective: REPORT-I The objective of this project is to design a 4-bit counter and implement it into a chip
Registers & ounters Logic and igital System esign - S 33 Erkay Savaş Sabanci University Registers Registers like counters are clocked sequential circuits A register is a group of flip-flops Each flip-flop
Module for Lab #16: Basic Memory evices evision: November 14, 2004 LAB Overview This lab introduces the concept of electronic memory. Memory circuits store the voltage present on an input signal (LHV or
EE 2 June 4, 22 igital esign Laboratory Handout #34 Midterm Examination #2 Solutions Open book, open notes. Time limit: 75 minutes. (2 points) Setup and hold times. The flip-flops below have setup time
PHYS 331: Junior Physics Laboratory I Notes on Digital Circuits Digital circuits are collections of devices that perform logical operations on two logical states, represented by voltage levels. Standard
The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with permission from Cengage Learning. Flip-Flops and
ECE 27 Learning Outcome 3 - - Practice Exam / Solution LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each
2065 Computer Science and Information Technology (CSc. 151) Pass Marks: 24 Time: 3 hours. Candidates are required to give their answers in their own words as for as practicable. Attempt any TWO questions:
1. A stage in a shift register consists of (a) a latch (b) a flip-flop (c) a byte of storage (d) from bits of storage 2. To serially shift a byte of data into a shift register, there must be (a) one click
1. Implement XNOR gate using NAND. 2. The output of the following circuit is a) (A+B) (C+D) b) AB+CD c) AC+BD d) (A+D) (B+C) 3. Which of the following memory element can have possible race condition. a)
Practice Homework Problems for Module 3. Given the following state transition diagram, complete the timing chart below. d 0 0 0 0d dd 0 d X Y A B 0 d0 00 0 A B X Y 2. Given the following state transition
Page No.1 File Version Update: (Dated: 17-May-2011) This version of file contains: Content of the Course (Done) FAQ updated version.(these must be read once because some very basic definition and question
Project 6: Latches and flip-flops Yuan Ze University epartment of Computer Engineering and Science Copyright by Rung-Bin Lin, 1999 All rights reserved ate out: 06/5/2003 ate due: 06/25/2003 Purpose: This
Copyright 2011 by Enoch Hwang, Ph.D. and Global Specialties All rights reserved. Printed in Taiwan. No part of this publication may be reproduced, stored in a retrieval system or transmitted, in any form
ENGN3213 Digital Systems and Microprocessors Sequential Circuits 1 ENGN3213: Digital Systems and Microprocessors L#9-10 Why have sequential circuits? Sequential systems are time sequential devices - many
cs281: Introduction to Computer Systems Lab07 - Sequential Circuits II: Ant Brain 1 Problem Statement Obtain the file ant.tar from the class webpage. After you untar this file in an empty directory, you
Lecture : A Design Example - Traffic Lights In this lecture we will work through a design example from problem statement to digital circuits. The Problem: The traffic department is trying out a new system
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.
Digital electronics 1-Sequential circuit counters Such a group of flip- flops is a counter. The number of flip-flops used and the way in which they are connected determine the number of states and also
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ T Flip-Flops & JK Flip-Flops CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6. - Introductory Digital Systems Laboratory (Spring 006) Laboratory - Introduction to Digital Electronics
EE 34 Lecture 2 Sequential ircuits (II) Overview of Sequential ircuits Storage Elements Sequential circuits Storage elements: Latches & Flip-flops Registers and counters ircuit and System Timing Sequential
Chapter 9 Timing esign (Based on Chapter 7 and Chapter 8 of Wakerly) Timing Check X State machine Next State Logic * * 0 1 State Memory 0 1 EN Counter * 0 * Incrementer 1 0 1 A B Reg Reg ata Path Comb.
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
Digital System Design by Dr. Lesley Shannon Email: firstname.lastname@example.org Course Website: http://www.ensc.sfu.ca/~lshannon/courses/ensc350 Simon Fraser University Slide Set: 8 Date: February 9, 2009 Timing
Efficient Architecture for Flexible Using Multimodulo G SWETHA, S YUVARAJ Abstract This paper, An Efficient Architecture for Flexible Using Multimodulo is an architecture which is designed from the proposed
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
2.6 Reset esign Strategy Many design issues must be considered before choosing a reset strategy for an ASIC design, such as whether to use synchronous or asynchronous resets, will every flipflop receive
ARLETON UNIVERSITY Deparment of Electronics ELE 3500 Digital Electronics October 17, 2006. The Tug-of-War Game Rev 11. 1.0 The Game : Overview The players of this game see a row of 7 LEDs represented by
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) ISSN: 2319 4200, ISBN No. : 2319 4197 Volume 1, Issue 4 (Nov. - Dec. 2012), PP 26-30 A Low Power Delay Buffer Using Gated Driver Tree Kokkilagadda
Digital Circuits II VHDL for Digital System Design Practical Considerations References: 1) Text Book: Digital Electronics, 9 th editon, by William Kleitz, published by Pearson Spring 2015 Paul I-Hai Lin,
Unit 2 Design Solutions Solutions to Unit 2 Design and Simulation Problems Problem 2. is a simulation exercise where students are required to design and simulate a counter. The problem has 4 parts of equal
Asynchronous counters In the previous section, we saw a circuit using one J-K flip-flop that counted backward in a two-bit binary sequence, from 11 to 10 to 01 to 00. Since it would be desirable to have
The University of Texas at Dallas Department of Computer Science CS 4141: Digital Systems Lab Experiment #5 Shift Registers, Counters, and Their Architecture 1. Introduction: In Laboratory Exercise # 4,
Laboratory Sequential Circuits Digital Design IE1204/5 Attention! To access the laboratory experiment you must have: booked a lab time in the reservation system (Daisy). completed your personal knowledge
ECE 301 Digital Electronics Counters (Lecture #20) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with
ECE 545 igital System esign with VHL Lecture B igital Logic Refresher Part B Sequential Logic Building Blocks Lecture Roadmap Sequential Logic Sequential Logic Building Blocks Flip-Flops, Latches Registers,
Chapter 9 Design of Counters 9.0 Introduction Counter is another class of sequential circuits that tally a series of input pulses which may be regular or irregular in nature. Counter can be divided into
Registers & ounters BME28 Logic ircuits Yalçın İŞLER email@example.com http://me.islerya.com Registers Registers are clocked sequential circuits A register is a group of flip-flops 2 Each flip-flop capable
Laboratory Sequence Circuits Digital Design IE1204/5 Attention! To access the laboratory experiment you must have: booked a lab time in the reservation system (Daisy). completed your personal knowledge
Sequential Logic ounters and Registers ounters Introduction: ounters Asynchronous (Ripple) ounters Asynchronous ounters with MOD number < 2 n Asynchronous Down ounters ascading Asynchronous ounters svbitec.wordpress.com
Johnson 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- 2555643 e mail : firstname.lastname@example.org
Computer Organization & Architecture Lecture #5 Shift Register A shift register is a register in which binary data can be stored and then shifted left or right when a shift signal is applied. Bits shifted
EE 3401 Lecture 11 Sequential ircuits Overview of Sequential ircuits Storage Elements Sequential circuits Storage elements: Latches & Flip-flops Registers and counters ircuit and System Timing Sequential