Chapter 5 counter

EE 202 DIGITAL ELECTRONICS

Chapter 5 : Counters

By:Siti Sabariah Salihin
Electrical Engineering Department

1



Programme Learning Outcomes, PLO
Upon completion of the programme, graduates should be able to:
PLO 1 : Apply knowledge of mathematics, scince and engineering
fundamentals to well defined electrical and electronic engineering
procedures and practices
� PLO 5: Work independently or as a team member successfully.
�

Course Learning Outcomes, CLO
� CLO 5 : Explain The Operation Of Basic Sequential Circuits
Correctly


2



Upon completion of the chapter, students should be able to:
5.1 Understand the basic concepts of asynchronous counter and
synchronous counters, and the difference between them.
5.1.1 Draw circuit and Timing Diagram of Asynchronous
Counters
5.1.2 Interpret the Operation and Application of an
asynchronous counter
5.1.3 Draw circuit and timing diagram of synchronous counters
5.1.4 Interpret the operation and application of synchronous
up/down counters.
5.1.5 Describe how the counters in 5.1.1 and 5.1.3 can be
connected in cascade to produce higher mod
5.1.6 Explain the application of counters in Digital Clock

Introduction –COUNTERS
�

A counter is a register that goes through a predetermined
sequence of states upon the application of clock pulses.
�
�

�

Asynchronous counters
Synchronous counters

Asynchronous Counters (or Ripple counters)
�
�

�

the clock signal (CLK) is only used to clock the first FF.
Each FF (except the first FF) is clocked by the preceding FF.

Synchronous Counters ,
�

�

the clock signal (CLK) is applied to all FF, which means that
all FF shares the same clock signal,
thus the output will change at the same time.


4

Introduction –COUNTERS
�

Modulus (MOD) – the number of states it counts in a complete cycle
before it goes back to the initial state.

�

Thus, the number of flip-flops used depends on the MOD of the counter
(ie; MOD-4 use 2 FF (2-bit), MOD-8 use 3 FF (3-bit), etc..)

�

Example: MOD-4 Ripple/Asynchronous Up-Counter.


5

Asynchronous Counters


6

Asynchronous (Ripple) UP Counters
�

The Asynchronous Counter that counts 4 number starts from
00�01�10�11 and back to 00 is called MOD-4 Ripple (Asynchronous)
Up-Counter.

�

Next state table and state diagram

Present State

Next State

Q1Q0

Q1Q0

00

01

01

10

10

11

11

00

00
11


01
10

7

�

A two-bit asynchronous counter is
shown on the left. The external clock is
connected to the clock input of the first
flip-flop (FF0) only. So, FF0 changes
state at the falling edge of each clock
pulse, but FF1 changes only when
triggered by the falling edge of the Q
output of FF0.

�

Figure 2.1 : MOD 4 Asynchronous Up Counter

Note that for simplicity, the transitions
of Q0, Q1 and CLK in the timing
diagram above are shown as
simultaneous even though this is an
asynchronous counter. Actually, there
is some small delay between the CLK,
Q0 and Q1 transitions.

Waveform


8


�

Because of the inherent propagation
delay through a flip-flop, the transition
of the input clock pulse and a transition
of the Q output of FF0 can never occur
at exactly the same time. Therefore,
the flip-flops cannot be triggered
simultaneously, producing an
asynchronous operation.

�

The 2-bit ripple counter circuit shown
has four different states, each one
corresponding to a count value.
Similarly, a counter with n flip-flops can
have 2 to the power n states. (2n) The
number of states in a counter is
known as its mod (modulo) number.
Thus a 2-bit counter is a mod-4 counter.

Waveform


9

�

Usually, all the CLEAR inputs are
connected together, so that a single
pulse can clear all the flip-flops before
counting starts. The clock pulse fed
into FF0 is rippled through the other
counters after propagation delays, like
a ripple on water, hence the name
Ripple Counter

�

A mod-n counter may also described as
a divide-by-n counter. This is because
the most significant flip-flop (the
furthest flip-flop from the original clock
pulse) produces one pulse for every n
pulses at the clock input of the least
significant flip-flop (the one triggers by
the clock pulse).

Waveform


10

MOD 8 Asynchronous Up Counter

�

�

The following is a three-bit
asynchronous binary counter and its
timing diagram for one cycle.
It works exactly the same way as a twobit asynchronous binary counter
mentioned above, except it has eight
states due to the third flip-flop

.

Waveform


11

MOD 8 Asynchronous Up Counter
Figure 2.3a Next State Table
Present State

CBA
001
010

010
011
100
101
110
111

011
100
101
110
111
000

0

Next State

CBA
000
001

Figure 2.3b State Diagram

7

1

6

2
5


3
4

12

Exercise :

A

1

J

Q

1

B
J

CLK
K

Q

Q

C
1

J

CLK
K

Q

Q
CLK

K

Q

CLK
A

0

B

0

C

0

13

MOD 16 Asynchronous Up counter – (Negative Triggered)


14

MOD 16 Asynchronous Up counter (Positive Triggered)

�

Exercise : Draw a MOD 16 Asynchronous DOWN Counter
(Negative Triggered) :


15

Asynchronous DOWN Counter
Figure 2.7 : MOD 4 or 2-bit Asynchronous down counter

A (LSB)
1

J

B (MSB)

1

Q

J

CLK

Q
CLK

K

Q

Q

K

CLK
A

0

1

0

1

0

1

0

1

0

B

0

1

1

0

0

1

1

0

0

Binary 0 � 3

� 2 � 1 � 0 � 3 �

2 �

1 � 0
16

�

Exercise:
�

Design a MOD-4 ripple down-counter

�

Design a MOD-8 ripple down counter
using negative triggered.

�

Design a MOD-16 ripple down counter
using positive triggered.


17

Asynchronous Counters (MOD ≠ 2N)
�

So far, we have design the counters with MOD number equal to
2N, where N is the number of bit (N = 1,2,3,4….) (also correspond
to number of FF)

�

Thus, the counters are limited on for counting MOD-2, MOD4,
MOD-8, MOD-16 etc..

�

The question is how to design a MOD-5, MOD-6, MOD-7, MOD-9
which is not a MOD-2N (MOD ≠ 2N) ?

�

MOD-6 counters will count from 0 10 (0002) to 510(1012) and after
that will recount back to 0 10 (0002) continuously.


18

MOD-6 ripple up-counter (MOD ≠ 2N)
Present St.

Next St.

CBA
000
001
010
011
100
101

CBA
001
010
011
100
101
000(110)

Figure 2.8b :State Diagram

0
5

1

4

2
3

Figure 2.8a :Next State Table

Reset the state to 0002
when 1102 is detected


19

�

Circuit diagram for MOD-6 ripple up-counter (MOD ≠ 2N)
A (LSB)
B
Present St.

Next St.

CBA
000
001
010
011
100
101

CBA
001
010
011
100
101
000(110)

C(MSB)

1
CLK

J

Q

1

J

Q

1

J

Q

CLK

CLK

CLK

K Q

K Q

K Q

CLR

CLR

CLR

Detect the output at
CBA=110 to activate
CLR. NAND gate is used
to detect outputs that generates ‘1’!


20

Exercise : Draw MOD-5 Ripple Down-counter and Upcounter (MOD ≠ 2N)


21

IC for Asynchronous counters (IC 74293)
�

74293 IC for Asynchronous counter with Reset (MR1 and MR2)
MR1
MR2

CP0

CP1
MR1
MR2

J Q
CLK
K
Q
CLR

CP0

Q3 Q2 Q1 Q0

Q0
1

CP1

74293

1

Q1
J Q
CLK
K
Q
CLR

Q2

1

J Q
CLK
K
Q
CLR


1

Q3
J Q
CLK
K
Q
CLR

22

�

Using 74293 IC to design MOD ≤ 16 Asynchronous UP-Counter!

�

Exercise:
�

Use 74293 IC to design MOD-10 ripple upcounter
MR1

CP1
74293

MR2

CP0

Q3 Q2 Q1 Q0
1

0

1

0


23

�

Exercise:
�

Determine the MOD for each configuration shown below?
MR1

CP1
74293

MR2

CP0

Q3 Q2 Q1 Q0

MR1

Answer : MOD 8

CP1
74293

MR2

CP0

Q3 Q2 Q1 Q0
1
0 1

Answer : MOD 5

24

�

Determine the MOD for configuration shown below?
MR1

CP1
74293

MR2

CP0

Q3 Q2 Q1 Q0
1

1

1

1
Answer : MOD 14


25

CASCADE connection to produce Higher Mod
Exercise : Design Asynchronous counters MOD-60
using IC 74293.
Solution : Discuss with your Lecturer in class.
Exercise : i. Design Asynchronous counters MOD-55
using IC 74293.
ii. Design Asynchronous counters MOD1000 using IC 74293.


26

Asynchronous Decade Counters
Figure 2.3 : Asynchronous Decade Counter

�

The binary counters previously introduced have two to the power n states. But
counters with states less than this number are also possible. They are designed to
have the number of states in their sequences, which are called truncated sequences.
These sequences are achieved by forcing the counter to recycle before going
through all of its normal states.

�

A common modulus for counters with truncated sequences is ten. A counter with
ten states in its sequence is called a decade counter . The circuit below is an
implementation of a decade counter.

27

Asynchronous Decade Counters
�

The sequence of the decade counter is
shown in the table below:

�

Once the counter counts to ten (1010),
all the flip-flops are being cleared.
Notice that only Q1 and Q3 are used to
decode the count of ten. This is called
partial decoding, as none of the other
states (zero to nine) have both Q1 and
Q3 HIGH at the same time.

Figure 2.4 : True Table Asynchronous Decade
Counter
28

Asynchronous Up-Down Counters
Figure 2.5 : Asynchronous Up-Down Counter

�

In certain applications a counter must be able to count both up and down.
The circuit below is a 3-bit up-down counter. It counts up or down
depending on the status of the control signals UP and DOWN. When the
UP input is at 1 and the DOWN input is at 0, the NAND network between
FF0 and FF1 will gate the non-inverted output (Q) of FF0 into the clock
input of FF1. Similarly, Q of FF1 will be gated through the other NAND
network into the clock input of FF2. Thus the counter will count up.

29

Figure 2.5 : Asynchronous Up-Down Counters

�

When the control input UP is at 0 and DOWN is at 1, the inverted outputs of
FF0 and FF1 are gated into the clock inputs of FF1 and FF2 respectively. If
the flip-flops are initially reset to 0's, then the counter will go through the
following sequence as input pulses are applied.

E2002 : Electronic System 2

30


�

Notice that an asynchronous up-down counter is slower than an
up counter or a down counter because of the additional
propagation delay introduced by the NAND networks.


31

Figure 2.3 : Asynchronous Up-Down Counters Waveform For 4 Bit Up-Down Counter


32

�

Disadvantages of Asynchronous Counters:�

�

Existence of ‘glitch’ is inevitable for MOD ≠ 2N counters.

�

�

Propagation delay is severe for larger MOD of counters, especially
at the MSB.

Cannot design random counters (i.e:- to design circuit that counts
numbers in these sequence
5�6�7�2�3�1�5�6�7�2�3�1�5�6….)

Solution, use SYNCHRONOUS COUNTERS


.

33

Synchronous Counters


34

�

A synchronous counter , in contrast to an asynchronous counter , is one whose
output bits change state simultaneously, with no ripple. The only way we can build
such a counter circuit from J-K flip-flops is to connect all the clock inputs together,
so that each and every flip-flop receives the exact same clock pulse at the exact
same time:


35

�

Now, the question is, what do we do with the J and K inputs? We know that we still have to
maintain the same divide-by-two frequency pattern in order to count in a binary sequence, and
that this pattern is best achieved utilizing the "toggle" mode of the flip-flop, so the fact that the
J and K inputs must both be (at times) "high" is clear. However, if we simply connect all the J
and K inputs to the positive rail of the power supply as we did in the asynchronous circuit, this
would clearly not work because all the flip-flops would toggle at the same time: with each and
every clock pulse!


36



37



38

How To Design Synchronous Counter
�

For synchronous counters, all the flip-flops are using the
same CLOCK signal. Thus, the output would change
synchronously.

�

Procedure to design synchronous counter are as follows:STEP 1: Obtain the State Diagram.
STEP 2: Obtain the Excitation Table using state transition
table for any particular FF (JK or D). Determine number
of FF used.
STEP 3: Obtain and simplify the function of each FF input
using K-Map.
STEP 4: Draw the circuit.

39

�

Design a MOD-4 synchronous up-counter,
using JK FF.
STEP 1: Obtain the State transition Diagram
00

0
3

1

Binary

11

01
10

2


40

STEP 2: Obtain the Excitation table. Two JK FF are used.
OUTPUT TRANSITION
QN
QN+1
0 � 0
0 � 1
1 � 0
1 � 1

FF INPUT
J
K
0
X
1
X
X
1
X
0

Excitation table

Present State

Next State

BA
0 0
0 1
1 0
1 1

BA
0 1
1 0
1 1
0 0

Input, J K
JB KB
0 X
1 X
X 0
X 1


JA KA
1 X
X 1
1 X
X 1
41

STEP 3: Obtain the simplified function using K-Map

B

B
A

0
0 0
1 X

1
1
X

A

JB = A

0
0 1
1 1

1
X
1

KB = A

1
1
1

KA = 1

B

B
A

0
0 X
1 0

1
X
X

A

JA = 1

0
0 X
1 X

42

STEP 4: Draw the circuit diagram.
A (LSB)
1

B (MSB)

J A QA

JB QB

CLK

CLK

KA Q A

KB QB

(MOD-4 synchronous up-counter )


43

How To design Synchronous Counter
�

Let us employ these techniques to design a MOD-8 counter to count in the
following sequence: 0, 1, 2, 3, 4, 5, 6, 7.

�

Step1: Determined Flip Flop Used and Creating state transition
diagram. (Rajah Keadaan)

N = 2

n

8 = 2n
n = log 8 / log 2
= 3 Flip Flop ( 3 Bit )
n

M = 2 -1
= 23 - 1

=8-1=7

N = Modulo/MOD
n = Flip Flop Used
M = Maximum Number To Be Count


44

How To design Synchronous Counter
�

Step 2: Creating present state-next state table
Present State

Next State

Q2

Q1

Q0

Q2

Q1

Q0

0

0

0

0

0

1

0

0

1

0

1

0

0

1

0

0

1

1

0

1

1

1

0

0

1

0

0

1

0

1

1

0

1

1

1

0

1

1

0

1

1

1

1

1

1

0

0

Q0 = QA
Q1 = QB
Q2 = Q c

0


45

Step 3: Expand the present state-next state table to form the transition
table.

�

Present
State

Excitation Table
(Jadual Ujaan Flip Flop
JK)
_
J
K
Q
Q

Next State

Present inputs

QC

QB

QA

QC

QB

QA

JCKC

JBKB

JAKA

0

0

0

0

0

1

0X

0X

1X

0

0

1

0

1

0

0X

1X

X1

0

0

0

X

0

1

0

0

1

1

0X

X0

1X

0

1

1

X

0

1

1

1

0

0

1X

X1

X1

1

0

X

1

1

0

0

1

0

1

X0

0X

1X

1

1

X

0

1

0

1

1

1

0

X0

1X

X1

1

1

0

1

1

1

X0

X0

1X

1

1

1

0

0

0

X1

X1

X1

‘X’ indicates a "don’t care" condition.
"don’


46

�

Step 4: Use Karnaugh maps to identify the present state logic functions
for each of the inputs.
E.g. for J 2 we get:

QcQB

QcQB
00
QA

0

0

QA

1

0

01

JC

=

0
1

11

10

0

2

X

6

X

4

1

3

X

7

X

5

Q BQ A

Using similar techniques for the other inputs we get:
KC =

QBQA

JB =

QA

KB =

QA

JA =

1

KA =

1

47

�

Step 5: Constructing Circuit

A

A

A

B

B

A

B

B


C

C

C

C

48

that count Random number
Example :

Design a Synchronous Counter to Count 4,7,3,0 and 2 respectively
using JKFlip Flop negative trigered by showing:
i. Flip Flop Used
ii. State Transition Diagram
iii. Exitation Table / Present state, next State
iv. Karnough Map & perform Simplified Function
v. The Synchronous Counter


Synchronous Counter to Count 4,7,3,0 and 2 respectively

Solution:
Step 1 : Flip Flop Used
n
Find Modulo, N= 2
n

M = 7, M = 2 -1 = 7
n

2 =N

, so, N = 7+1 = 8, MOD 8

n

2 = 8, n = log 8 / log 2
n = 3 bit = 3 Flip Flop.



Solution:
Step 2 : State Transation
Diagram, to count 4, 7, 3, 0
and 2.

010

011

Next
State
Qn+1

J

K

0

0

x

0

1

1

x

1

0

x

1

1

111

Present
Qn

0

100

000

Exitation Truth Table For Counter
using JK FlipFlop

1

x

0


Step 3 : Exitation Table /present State, Next State
Deci
mal

Present
State

Next State

JC KC JB KB JA KA

QC

QB

QA

QC

QB

QA

4

1

0

0

1

1

1

x

0

1

x

1

x

7

1

1

1

0

1

1

x

1

x

0

x

0

3

0

1

1

0

0

0

0

x

x

1

x

1

0

0

0

0

0

1

0

0

x

1

x

0

x

2

0

1

0

1

0

0

1

x

x

1

0

x



Step 4: Karnough Map and
Simplified Function
CB

00

01

11

10

0

0

x

1

A
0

0
1

x

2

x
1

6

x
3

4

x

7

5

K-Map For

JA = QC


K-Map For

JA = QC
CB

K-Map For

KA = QC

00

01

11

10

A

0

01

11

10

X

X

X

X

A

0

0
0

1

CB 00

X

X
2

X
1

1
6

X
3

7

0

4

X

0

1

5


X

2

1
1

6

0
3

4

X
7

5


K-Map For

JB = 1
CB

K-Map For

KB = QC

00

01

11

10

A

0

01

11

10

X

1

X

X

A

1

X
0

1

CB 00

X

X
2

X
1

1
6

X
3

7

0

4

X

0

1

5


X

2

1
1

6

0
3

4

X
7

5


K-Map For

K-Map For

JC = QA+QB

KC = QB

CB 00

01

11

10

0

1
0

1

00

01

11

10

0

X

X

X

0

A

A

0

CB

X

X
2

0
1

X
6

X
3

1

X
7

0

4

5


X

2

X
1

6

1
3

4

X
7

5


Step 5 : Perform Counter Circuit
By using simplified function from K-Map, JA = QC,
JB = 1, KB = QC, JC = QA + QB, KC = QB
'1' / Vdd

KA = QC,

JA QA

J B QB

JC QC

KA QA

KB QB

K C QC

CP,CLOCK PULSE

Synchronous Counter
Exercises:
� Design a counter to count in the following
sequence: 6, 4. 2, 3, 1.
�

Design a counter to count in the following
sequence: 15,9,11,5,2,13,1.

�

Do more exercises in Past Years Exam Paper.
End Of This Topic…..

58

REFERENCES:
1. "Digital Systems Principles And Application"
Sixth Editon, Ronald J. Tocci.
2. "Digital Systems Fundamentals"
P.W Chandana Prasad, Lau Siong Hoe,
Dr. Ashutosh Kumar Singh, Muhammad Suryanata.

Download Tutorials Chapter 5: Counter
@ CIDOS
http://www.cidos.edu.my


59

Chapter 5 counter

More Related Content

What's hot (20)

Similar to Chapter 5 counter (20)

Recently uploaded (20)

Chapter 5 counter