CS 140L Lecture 5 Professor CK Cheng 4/29/02. Asynchronous Counter D Q CLK D Q D Q There are n flip-flops. D FF is the delay of each flip-flop. When n.

Slides:

Advertisements

Similar presentations

COUNTERS Counters with Inputs Kinds of Counters Asynchronous vs

Advertisements

CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1.

ECE543 Intro to Digital Systems Lecture 36 Propagation Delay in Counter Designs II 04/26/2013.

CHAPTER 3 Sequential Logic/ Circuits.  Concept of Sequential Logic  Latch and Flip-flops (FFs)  Shift Registers and Application  Counters (Types,

Digital Logic Chapter 5 Presented by Prof Tim Johnson

Sequential Logic Latches and Flip-Flops. Sequential Logic Circuits The output of sequential logic circuits depends on the past history of the state of.

EKT 124 / 3 DIGITAL ELEKTRONIC 1

CS 140L Lecture 5 Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 7 Professor CK Cheng 4/23/02. Part II. Sequential Network (Ch ) 1.Flip-flops SR, D, T, JK, 2.SpecificationState Table 3.Implementation.

CS 140 Lecture 8 Professor CK Cheng 4/26/02. Part II. Sequential Network 1.Memory SR, D, T, JK, 2.Specification S XY s i t+1 = g i (S t, X t )

CSE 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140L Lecture 7 Professor CK Cheng 5/13/02. Announcements  State Assignment: Chapters 7.4.3, 7.7.3, kinds of coding: 1) Binary – [ log 2 n ]

CS 140L Lecture 5: Counters Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140 Lecture 8 Sequential Networks Professor CK Cheng CSE Dept. UC San Diego.

CSE 140L Lecture 4 Flip-Flops, Shifters and Counters Professor CK Cheng CSE Dept. UC San Diego.

Sequential Circuits and Finite State Machines Prof. Sin-Min Lee

Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.1, 7.2 Counters.

CS 140 Lecture 10 Professor CK Cheng 5/02/02. Given the state table, implement with 2 JK flip flops id Q 1 (t) 0 1 Q 0 (t) X(t)

Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.

ENGIN112 L27: Counters November 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 27 Counters.

CS 140L Lecture 7 Professor CK Cheng 11/12/02. Transformation between Mealy and Moore Machines Algorithm: 1) For each NS, z = S i, j create a state S.

CS 140 Lecture 18 Professor CK Cheng 12/3/02. Standard Sequential Modules 1.Register 2.Shift Register 3.Counter.

CS 140L Lecture 9 Professor CK Cheng 6/03/02. transistors modules sequential machine system 1.Adders, Muxes 2.F-Fs and counters 3.Finite State Machine.

CS370 Counters. Overview °Counter: A register that goes through a prescribed series of states °Counters are important components in computers. °Counters.

ECE 331 – Digital System Design Counters (Lecture #18)

CS 140 Lecture 8 Professor CK Cheng 10/22/02. Part II. Sequential Network 1.Flip-flops SR, D, T, JK, State Table Characteristic Eq. Q(t+1) = f(x(t), Q(t)).

Asynchronous and Synchronous Counters

CS 140L Lecture 4 Professor CK Cheng 10/22/02. 1)F-F 2)Shift register 3)Counter (Asynchronous) 4)Counter (Synchronous)

Design of Counters ..

A presentation on Counters

Electronics Technology

Digital Systems I EEC 180A Lecture 15 Bevan M. Baas Tuesday, November 20, 2007.

Chapter 1_4 Part II Counters

Asynchronous Counter © 2014 Project Lead The Way, Inc.Digital Electronics.

Counter Section 6.3.

Principles & Applications

Electronics Technology

Asynchronous Counters with SSI Gates

Introduction to Sequential Logic Design Flip-flops.

Lecture 1 Combinational Logic Design & Flip Flop 2007/09/07 Prof. C.M. Kyung.

Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 17 Dr. Shi Dept. of Electrical and Computer Engineering.

Counters. November 5, 2003 Introduction: Counters  Counters are circuits that cycle through a specified number of states.  Two types of counters: 

Digital Design Lectures 11 & 12 Shift Registers and Counters.

 Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences.

ECA1212 Introduction to Electrical & Electronics Engineering Chapter 9: Digital Electronics – Sequential Logic by Muhazam Mustapha, November 2011.

Topic: Sequential Circuit Course: Logic Design Slide no. 1 Chapter #6: Sequential Logic Design.

CHAPTER 8 - COUNTER -.

9/15/09 - L24 Other FF TypesCopyright Joanne DeGroat, ECE, OSU1 Other FF Types.

BR 8/991 DFFs are most common Most programmable logic families only have DFFs DFF is fastest, simplest (fewest transistors) of FFs Other FF types (T, JK)

Registers; State Machines Analysis Section 7-1 Section 5-4.

Counters and Registers Synchronous Counters. 7-7 Synchronous Down and Up/Down Counters  In the previous lecture, we’ve learned how synchronous counters.

Digital Electronics.

Digital System Design using VHDL

Learning to Design Counters

CEC 220 Digital Circuit Design Counters Using S-R and J-K Flip-Flops Monday, November 2 CEC 220 Digital Circuit Design Slide 1 of 19.

Modulo-N Counters According to how they handle input transitions –Synchronous –Asynchronous.

CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.

Unit 1 – Counters and Registers Mr. Grimming. Introduction FFs and logic gates are combined to form various counters and registers. Unit Goals Goals:

ENG241 Digital Design Week #7 Sequential Circuits (Part B)

3 BIT DOWN COUNTER SUBJECT: DIGITAL ELECTONICS CODE: COLLEGE: BVM ENGINEERING COLLEGE COLLEGE CODE:008 ELECTRONICS & TELECOMMUNICATION DEPT.

Dept. of Electrical Engineering

1 CS 352 Introduction to Logic Design Lecture 6 Ahmed Ezzat Latches, Flip/Flops, Registers, and Counters Ch-11 + Ch-12.

Flip-Flop Flip-flops Objectives Upon completion of this chapter, you will be able to :  Construct and analyze the operation of a latch flip-flop made.

Shift Register Counters

Synchronous Counters, ripple counter & other counters Lecture 2

CS 140 Lecture 19 Standard Modules

CHAPTER 4 COUNTER.

Switching Theory and Logic Design Chapter 5:

Presentation transcript:

CS 140L Lecture 5 Professor CK Cheng 4/29/02

Asynchronous Counter D Q CLK D Q D Q There are n flip-flops. D FF is the delay of each flip-flop. When n * D FF > T, then we are in trouble.

Synchronous Counter D Q D Q D Q CLK BUFGP C(t+1) = C’(t) B(t+1) = B(t) + C(t) A(t+1) = A(t) + (B(t)C(t)) A B C A(t+1) B(t+1) C(t+1) Check Chapter 8 for a synchronous counter using T F-Fs.

When comparing networks, there are two things to keep track of: Cost vs. performance. For example, the synchronous counter has better performance but higher costs due to the added gates. On the other hand, the asynchronous counter is easier to implement. As the length of the counter increases, the cost increases, since the the number of gates increases.

Johnson Counter D Q CLK CLR D Q D Q Q’ ABC Time Steps A B C 1)Given n flip-flops, we have 2n states. Much less than previous counters. But Johnson is fast! 2)Only one output changes (low power). 3)Each output has n/f width (symmetrical). 4)Reset is important. (ie, we don’t want to start with 010 since if we do it ends up as 010- >101->010->101 etc.

Odd Length Walking – Ring Counter J K CLR Q Q’ J K Q J K Q ABC Time Steps A B C J A K A A (t+1) 0 0 A(t) A’(t) n JK F-Fs -> 2n-1 states The counter works itself back to the proper sequence.

Pseudo Random Sequencer n = 4, length = 15 D Q CLK D Q D Q D Q