Copyright Joanne DeGroat, ECE, OSU

Slides:

Advertisements

Similar presentations

L15 – Specification of State Machines

Advertisements

L9 – State Assignment and gate implementation. States Assignment  Rules for State Assignment  Application of rule  Gate Implementation  Ref: text.

STATE DIAGRAM AND STATE TABLES

Combinational Circuits ENEL 111. Common Combinationals Circuits NAND gates and Duality Adders Multiplexers.

التصميم المنطقي Second Course

Circuits require memory to store intermediate data

CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.

Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.

EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)

ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)

Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.

9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.

EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – Floating Point – Finite State Machines – Combinational Logic – Sequential Logic 2.

L5 – Sequential Circuit Design

9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.

9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

L10 – State Machine Design Topics. States Machine Design  Other topics on state machine design Equivalent sequential machines Incompletely specified.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

Sequential Design Basics. Lecture 2 topics  A review of devices that hold state A review of Latches A review of Flip-Flops 8/22/2012 – ECE 3561 Lect.

9/15/09 - L21 Sequential Circuit Analaysis Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Analysis.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.

Sequential Circuit: Analysis BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.

Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.

9/15/09 - L19 Sequential CircuitsCopyright Joanne DeGroat, ECE, OSU1 Sequential Cirucits.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

A sequential logic circuit (a.k.a. state machine) consists of both combinational logic circuit(s) and memory devices (flip flops). The combinational circuits.

Introduction to Sequential Logic Design Finite State-Machine Analysis.

Figure S1.1 The Motorola MPC 7400 PowerPC CPU. Figure S1.3 Truth table for INCLUSIVE-OR operation.

CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.

5 - 1 Chapter 6 Analysis of Sequential Systems Chapter 6 Analysis of Sequential Systems 6.0 Introduction  Clocked System Clock A signal that alternates.

Common Elements in Sequential Design. Lecture 3 topics  Registers and Register Transfer  Shift Registers  Counters Basic Counter Partial sequence counters.

4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.

Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.

State Machine Design with an HDL

Figure 8.1. The general form of a sequential circuit.

L5 – Sequential Circuit Design

Introduction to Sequential Logic Design

Mealy Machine x X1 X2 S S1 S2 S3 x X1 X2 S S1 Y1 Y2 S2 Y3 S3 outputs

Analysis of Clocked Sequential Circuit

Learning Outcome By the end of this chapter, students are expected to refresh their knowledge on sequential logic related to HDL.

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

CSNB163 Digital Logic Design

Copyright Joanne DeGroat, ECE, OSU

CSE 140 MT 2 Review By Daniel Knapp.

Instructor: Alexander Stoytchev

Digital Design Fundamentals

Chapter 6 -- Introduction to Sequential Devices

ECE 434 Advanced Digital System L04

ECE 3130 – Digital Electronics and Design

L10 – additional State Machine examples

Week 7: Gates and Circuits: PART II

Incrementing and Decrementing

Instructor: Alexander Stoytchev

State Machine Design with an HDL

Lecture No. 32 Sequential Logic.

Chapter 10.3 and 10.4: Combinatorial Circuits

L11 – Midterm Review.

Instructor: Alexander Stoytchev

SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.

L7s Multiple Output example

L11 – State Machine Analysis

L4 – An overview of Quartis

Chapter 5 Sequential Circuits.

L25 – Final Review AU 15 Final Exam – Classroom – Journalism 300

Presentation transcript:

Copyright 2009 - Joanne DeGroat, ECE, OSU Exam 2 Review 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Copyright 2009 - Joanne DeGroat, ECE, OSU Exam 2 topics Minimal sum-of-products K-maps AND-OR equivalence with NAND-NAND Multipexers Adders Flip-flops Sequential Circuit Analysis 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Minimal Sum-of-Products/K-maps Be able to go from a K-map to a minimal sum-of-products representation of the function. Can do this for 2 variables, 3 variables, 4 variables 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Copyright 2009 - Joanne DeGroat, ECE, OSU AND-OR and NAND-NAND Know the equivalence of AND-OR with NAND-NAND Be capable of generating an AND-OR gate circuit from and expression, and then convert that AND-OR implementation into a NAND-NAND circuit. 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Copyright 2009 - Joanne DeGroat, ECE, OSU ADDERS Know what a half-adder is Know its circuit Know what a full-adder is Know the circuit for a full adder (AND-OR) Be able to construct a full adder from half adders 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Copyright 2009 - Joanne DeGroat, ECE, OSU Flip-flops Know the SR flip-flop Know the SR latch Know the D latch Know the D FF 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU

Copyright 2009 - Joanne DeGroat, ECE, OSU Sequential circuits Know how to analyze a sequential circuit. Be able to generate the next state equations Be able to generate a state table from these equations Be able to generate a state diagram from a state table Know the definition and difference of a Mealy machine from a Moore machine. 9/15/09 - L24 Other FF Types Copyright 2009 - Joanne DeGroat, ECE, OSU