Document Sample

COE 202: Digital Logic Design Sequential Circuits Part 2 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Ahmad Almulhem, KFUPM 2009 Objectives • Analysis of Synchronous Sequential Circuits • Procedure • Examples Ahmad Almulhem, KFUPM 2009 Analysis of Combinational vs Sequential Circuits Combinational : Sequential : •Boolean Equations •State Equations •Truth Table •State Table •State Diagram •Output as a function of •Output as a function of input and current state inputs •Next state as a function of inputs and current state. Ahmad Almulhem, KFUPM 2009 Analysis of Sequential Circuits Steps: • Obtain state equations • FF input equations • Output equations • Fill the state table • Put all combinations of inputs and current states • Fill the next state and output • Draw the state diagram Ahmad Almulhem, KFUPM 2009 State Table 4 sections Ahmad Almulhem, KFUPM 2009 State Table (2-D Form) 1 Ahmad Almulhem, KFUPM 2009 State Diagram • The state diagram is a graphical representation of a state table (provides same information) • Circles are states (FFs), Arrows are transitions between states • Labels of arrows represent inputs and outputs Ahmad Almulhem, KFUPM 2009 Example 1 Analyze this circuit? • Is this a sequential circuit? Why? • How many inputs? • How many outputs? • How many states? • What type of memory? Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) D Flip Flop (review) Characteristic Tables and Equations Q(t) D Q(t+1) 0 0 0 D Q(t+1) 0 1 1 0 0 Q(t+1) = D 1 0 0 1 1 1 1 1 Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ State table: Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) State equations: DA = AX + BX DB = A’ X Y = (A + B) X’ State table (2D): Ahmad Almulhem, KFUPM 2009 Example 1 (cont.) State equations: State diagram: DA = AX + BX DB = A’ X Y = (A + B) X’ State table: Ahmad Almulhem, KFUPM 2009 Example 2 • Analyze this circuit. • What about the output? • This circuit is an example of a Moore machine (output depends only on current state) • Mealy machines is the other type (output depends on inputs and current states) Ahmad Almulhem, KFUPM 2009 Example 2 (cont.) Equation: DA = A X Y Ahmad Almulhem, KFUPM 2009 Example 2 (cont.) Equation: DA = A X Y Ahmad Almulhem, KFUPM 2009 Example 3 Analyze this circuit? • Is this a sequential circuit? Why? • How many inputs? • How many outputs? • How many states? • What type of memory? Ahmad Almulhem, KFUPM 2009 Example 3 (cont.) JK Flip Flop (review) Characteristic Tables and Equations J K Q(t+1) 0 0 Q(t) 0 1 0 Q(t+1) = JQ’ + K’Q 1 0 1 1 1 Q’(t) Ahmad Almulhem, KFUPM 2009 Example 3 (cont.) Ahmad Almulhem, KFUPM 2009 Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ Ahmad Almulhem, KFUPM 2009 Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ Ahmad Almulhem, KFUPM 2009 Example 3 (cont.) State equations: JA = B, KA = B X’ JB = X’, KB = A X by substitution: A = JAA’ + KA’A = A’ B + A B’ + A X B = B’ X’ + A B X + A’ B X’ Ahmad Almulhem, KFUPM 2009 Example 4 Ahmad Almulhem, KFUPM 2009 Example 4 (cont.) State equations: JA = BX’ KA = BX’ + B’X DB = X Y = X’AB by substitution: A(t+1) = JAA’ + KA’A Ahmad Almulhem, KFUPM 2009 Example 4 (cont.) State equations: Current State Input Next State Output JA = BX’ A(t) B(t) X A(t+1) B(t+1) Y KA = BX’ + B’X 0 0 0 0 0 0 DB = X 0 0 1 0 1 0 Y = X’AB 0 1 0 1 0 0 by substitution: 0 1 1 0 1 0 A(t+1) = JAA’ + KA’A 1 0 0 0 0 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 1 0 1 0 Ahmad Almulhem, KFUPM 2009 Example 5 Analyze this circuit? • Is this a sequential circuit? Why? • How many inputs? • How many outputs? • How many states? • What type of memory? Ahmad Almulhem, KFUPM 2009 Example 5 (cont.) T Flip Flop (review) Characteristic Tables and Equations T Q(t+1) 0 Q(t) Q(t+1) = TQ’ + T’Q 1 Q’(t) Ahmad Almulhem, KFUPM 2009 Example 5 (cont.) Ahmad Almulhem, KFUPM 2009 Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A Ahmad Almulhem, KFUPM 2009 Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A Ahmad Almulhem, KFUPM 2009 Example 5 (cont.) State equations: TA = BX TB = X Y = AB by substitution: A(t+1) = TAA’ + TA’A The output depends only on current state. This is a Moore machine What does this circuit do? Ahmad Almulhem, KFUPM 2009 Mealy vs Moore Finite State Machine (FSM) Mealy FSM: Moore FSM: • Output depends on current • Output depends on current state and input state only • Output is not synchronized with the clock Ahmad Almulhem, KFUPM 2009 Summary • To analyze a sequential circuit: • Obtain state equations • FF input equations • Output equations • Fill the state table • Put all combinations of inputs and current states • Fill the next state and output • For the next state use characteristic table/equation • Draw the state diagram • Two types of synchronous sequential circuits (Mealy and Moore) Ahmad Almulhem, KFUPM 2009

DOCUMENT INFO

Shared By:

Categories:

Tags:

Stats:

views: | 31 |

posted: | 10/1/2011 |

language: | English |

pages: | 34 |

OTHER DOCS BY malj

How are you planning on using Docstoc?
BUSINESS
PERSONAL

By registering with docstoc.com you agree to our
privacy policy and
terms of service, and to receive content and offer notifications.

Docstoc is the premier online destination to start and grow small businesses. It hosts the best quality and widest selection of professional documents (over 20 million) and resources including expert videos, articles and productivity tools to make every small business better.

Search or Browse for any specific document or resource you need for your business. Or explore our curated resources for Starting a Business, Growing a Business or for Professional Development.

Feel free to Contact Us with any questions you might have.