Chapter 1 Counters. Counters Counters are sequential circuits which "count” through a specific state sequence. They can count up, count down, or count.

Slides:



Advertisements
Similar presentations
Registers and Counters
Advertisements

Sequential Circuit - Counter -
Logic and Computer Design Fundamentals Registers and Counters
CS370 Counters. Overview °Counter: A register that goes through a prescribed series of states °Counters are important components in computers. °Counters.
M.S.P.V.L. Polytechnic College, Pavoorchatram
Asynchronous and Synchronous Counters
Sequential Circuit Introduction to Counter
KU College of Engineering Elec 204: Digital Systems Design
Registers and Counters
Chapter 9 Counters.
Counters  A counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship.
Design of Counters ..
CHAPTER 3 Counters.  One of the common requirement in digital circuits/system is counting, both direction (forward and backward)  Digital clocks and.
A presentation on Counters
Electronics Technology
A State Element “Zoo”.
Chapter 1_4 Part II Counters
Sequential Circuit - Counter -
Mid3 Revision Prof. Sin-Min Lee. 2 Counters 3 Figure 9--1 A 2-bit asynchronous binary counter. Asynchronous Counter Operation.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
Electronics Technology
Rabie A. Ramadan Lecture 3
Digital Design: Principles and Practices
P. 4.1 Digital Technology and Computer Fundamentals Chapter 4 Digital Components.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Counters Dr. Rebhi S. Baraka Logic Design (CSCI 2301) Department of Computer Science Faculty of Information Technology The Islamic University.
2017/4/24 CHAPTER 6 Counters Chapter 5 (Sections )
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Synch 1.1 Synchronous Counters 1 ©Paul Godin Created January 2008.
Counters By Taweesak Reungpeerakul
Counter Classification Count modulus (MOD) – total number of states in the counter sequence Counter triggering technique – positive edge or negative edge.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 17 Dr. Shi Dept. of Electrical and Computer Engineering.
BZUPAGES.COM1 Chapter 9 Counters. BZUPAGES.COM2 BzuPages.COM Please share your assignments/lectures & Presentation Slides on bzupages which can help your.
Counters. November 5, 2003 Introduction: Counters  Counters are circuits that cycle through a specified number of states.  Two types of counters: 
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 7 – Registers.
7-6 단일 레지스터에서 Microoperation Multiplexer-Based Transfer  Register 가 서로 다른 시간에 둘 이상의 source 에서 data 를 받을 경우 If (K1=1) then (R0 ←R1) else if (K2=1) then.
 Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences.
Registers and Counters Chapter 6. Digital Circuits 2 Clocked sequential circuits a group of flip-flops and combinational gates connected to form a feedback.
Asynch 1.1 Asynchronous Counters 1 ©Paul Godin Last Edit Sept 2009.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Chapter 1_4 Part III more on … Counters Chapter 1_4 Part III more on … Counters.
CHAPTER 8 - COUNTER -.
Counter Circuits and VHDL State Machines
Sequential logic circuits
Decade Counter (BCD Counter). Introduction A counter which is reset at the 10 th clock pulse is called decade counter. The decade counter is otherwise.
Counters and Registers Synchronous Counters. 7-7 Synchronous Down and Up/Down Counters  In the previous lecture, we’ve learned how synchronous counters.
COUNTERS Why do we need counters?
Counters.
Counters.
Basic terminology associated with counters Technician Series
Unit 1 – Counters and Registers Mr. Grimming. Introduction FFs and logic gates are combined to form various counters and registers. Unit Goals Goals:
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part.
1 Registers A register is a group of n flip-flops each of them capable of storing one bit of information There are two types of registers: parallel and.
Sequential logic circuits First Class 1Dr. AMMAR ABDUL-HAMED KHADER.
FLIP FLOPS Binary unit capable of storing one bit – 0 or 1
6.
EKT 221 : Digital 2 COUNTERS.
Sequential Logic Counters and Registers
Sequential Circuit: Counter
Chapter 7 – Registers and Register Transfers
DR S. & S.S. GHANDHY ENGINEENRING COLLEGE
Sequential Circuit - Counter -
29-Nov-18 Counters Chapter 5 (Sections ).
Registers and Register Transfers
Computer Architecture and Organization: L02: Logic design Review
EET107/3 DIGITAL ELECTRONICS 1
Registers and Register Transfers
Counters.
Digital Electronics and Logic Design
Presentation transcript:

Chapter 1 Counters

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: 1. Ripple counters (Asynchronous counter) 2. Synchronous counter

Ripple Counters – Clock is connected to the flip-flop clock input on the LSB bit flip-flop – For all other bits, a flip-flop output is connected to the clock input, thus circuit is not truly synchronous – Output change is delayed more for each bit toward the MSB. – Resurgent because of low power consumption

Revision of Ripple Counters Let’s look at some slides from Digit 1. Let’s look at some slides from Digit 1.

A 2-bit asynchronous (ripple) binary counter (Rev) Both flip-flops are assumed to be initially RESET (Q low) Both flip-flops are assumed to be initially RESET (Q low) Q 0 is always the LSB unless otherwise specified Q 0 is always the LSB unless otherwise specified

The Timing diagram for 2 bit Asynchronous Binary Counter (Rev) This is a complete timing diagram & propagation delay time are not indicated. This is a complete timing diagram & propagation delay time are not indicated. Delay timing are normally omitted for simplicity but it is very important in design & troubleshooting purposes Delay timing are normally omitted for simplicity but it is very important in design & troubleshooting purposes

The Binary State Sequence for 2 bit Asynchronous Binary Counter (Rev) CLOCK PULSE Q1Q0 Initially (recycles) 00

Ripple Counter How does it works? How does it works? – When there is a positive Clock edge on the clock input of A, A complements – The clock input for flip flop B is the Complemented output of flip-flop A – When flip A changes from 1 to 0, there is a positive edge on the clock input of B causing B to complement

3-bit asynchronous binary counter and its timing diagram for one cycle. (Rev)

The Binary State Sequence for a 3- bit Binary Counter (Rev) CLOCK PULSE Q2Q2Q2Q2 Q1Q1Q1Q1 Q0Q0Q0Q0 Initially (recycles) 000

Propagation delays in a 3-bit asynchronous (ripple-clocked) binary counter (Rev)

Ripple Counter

Four-bit asynchronous binary counter and its timing diagram (Rev)

Ripple Counter The arrows show the cause-effect relationship The corresponding sequence of states => (B,A) = (0,0),(0,1), (1,0), (1,1), (0,0), (0,1), … Each additional bit, C, D, …behaves like bit B, changing half as frequently as the bit before it. For 3 bits: (C,B,A) = (0,0,0), (0,0,1), (0,1,0), (0,1,1), (1,0,0), (1,0,1), (1,1,0), (1,1,1), (0,0,0), …

Ripple Counter These circuits are called ripple counters because each edge sensitive transition (positive in the example) causes a change in the next flip-flop’s state. The changes “ripple” upward through the chain of flip-flops, i. e., each transition occurs after a clock-to-output delay from the stage before. To see this effect in detail look at the waveforms on the next slide.

Ripple Counter

Starting with C = B = A = 1, equivalent to (C,B,A) = 7 base 10, the next clock increments the count to (C,B,A) = 0 base 10. In fine timing detail: – The clock to output delay tPHL causes an increasing delay from clock edge for A each stage transition. – Thus, the count “ripples” from least to most B significant bit. – For n bits, total worst case C delay is n tPHL.

Lets take 5 min break USA, SOVIET DAN SOUTH AFRICA berlumba-lumba untuk membuat “spaceship” untuk ke matahari. USA, SOVIET DAN SOUTH AFRICA berlumba-lumba untuk membuat “spaceship” untuk ke matahari. Dalam satu International seminar setiap negara telah membuat pembentangan Dalam satu International seminar setiap negara telah membuat pembentangan USA…… USA…… SOVIET……. SOVIET……. S.AFRICA….. S.AFRICA…..

Synchronous Counters – Clock is directly connected to the flip-flop clock inputs – Logic is used to implement the desired state sequencing

Revision of synchronous counter Slides from Digit 1 Slides from Digit 1

SYNCHRONOUS COUNTERS (Rev) All the flip-flops in the counter are clocked at the same time by a common clock pulse (external clock) All the flip-flops in the counter are clocked at the same time by a common clock pulse (external clock) 2 advantages compared to Asynchronous Counter : 2 advantages compared to Asynchronous Counter : 1) Very less propagation delay time 1) Very less propagation delay time 2) Able to perform counting in random mode 2) Able to perform counting in random mode (eg : 0,1,3,5,8, …,0,1,3,5,8,..) (eg : 0,1,3,5,8, …,0,1,3,5,8,..)

A 2-bit synchronous binary counter (Rev) Assumed initial in binary 0 states meaning that both flip--flops are in RESET condition. Assumed initial in binary 0 states meaning that both flip--flops are in RESET condition.

Timing diagram for 2-bit synchronous counter (Rev)

A 3-bit synchronous binary counter (Rev)

JKFF Truth Table JKQt 00 N. Change Toggle

JKFF Transition Table QtQt+1JK 000x 011x 10x1 11x0

Timing diagram for the counter (Rev)

Revision of Up / Down Counter

A basic 3-bit up/down synchronous counter (Rev)

Up/Down Synchronous Counter (Rev) Up Synchronous Counter : Up Synchronous Counter : UP is set to ‘1’ and AND gate 1 is active causing output OR gate 1 is HIGH. This will cause Q1 output toggling. The AND gate 2 also active causes Q2 toggling UP is set to ‘1’ and AND gate 1 is active causing output OR gate 1 is HIGH. This will cause Q1 output toggling. The AND gate 2 also active causes Q2 toggling Because of JK connection from Q output, the counting sequence is UP. Because of JK connection from Q output, the counting sequence is UP. Down Synchronous Counter : Down Synchronous Counter : DOWN is set to ‘1’ and AND gate 3 is active causing output OR gate 1 is HIGH. This will cause Q1 output toggling. The AND gate 4 also active causes Q2 toggling DOWN is set to ‘1’ and AND gate 3 is active causing output OR gate 1 is HIGH. This will cause Q1 output toggling. The AND gate 4 also active causes Q2 toggling Because of JK connection from Q output, the counting sequence is UP Because of JK connection from Q output, the counting sequence is UP

Timing Diagram Up/Down Synchronous Counter (Rev)

Other Counters – Down Counter - counts downward instead of upward – Up-Down Counter - counts up or down depending on value a control input such as Up/Down – Parallel Load Counter - Has parallel load of values available depending on control input such as Load Divide-by-n (Modulo n) Counter – Count is remainder of division by n which n may not be a power of 2 or – Count is arbitrary sequence of n states specifically designed state-by-state – Includes modulo 10 which is the BCD counter

Thank You.