Scribd
Upload
26 views26 pages

Counters

Uploaded by

amrit saud
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
26 views26 pages

Counters

Uploaded by

amrit saud
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

Sequential Logic

Counters
Counters
 A special type of sequential circuit used to count the pulse is
known as a counter. It's a collection of flip flops where
the clock signal is applied is known as counters.

 The counter that counts in ascending order is Up Counter


 The counter that counts in descending order Down Counter.

Counters are divided into two categories:

Asynchronous(Ripple) counter - No Universal clock for flip-flops


Synchronous counter – Universal clock for flip-flops
3-bit Asynchronous Up Counter
3-bit Asynchronous Up Counter
3-bit Asynchronous Up Counter
Clk Qc Qb Qa Dec
Initially(0) 0 0 0 0
1st 0 0 1 1
2nd 0 1 0 2
3rd 0 1 1 3
4th 1 0 0 4
5th 1 0 1 5
6th 1 1 0 6
7th 1 1 1 7
3-bit Asynchronous Down Counter
4-bit Asynchronous Up Counter
4-bit Asynchronous Up Counter
4-bit Asynchronous Up Counter
Clk Q3 Q2 Q1 Q0 Dec
Initially(0) 0 0 0 0 0
1st 0 0 0 1 1
2nd 0 0 1 0 2
3rd 0 0 1 1 3
4th 0 1 0 0 4
5th 0 1 0 1 5
6th 0 1 1 0 6
7th 0 1 1 1 7
8th 0 0 0 0 8
9th 1 0 0 1 9
10th 1 0 1 0 10
11th 1 0 1 1 11
12th 1 1 0 0 12
13th 1 1 0 1 13
14th 1 1 1 0 14
1. Design a 4-bit Asynchronous Down Counter.
2. Design a 2-bit Asynchronous Up Counter.
3. Design a 2-bit Asynchronous Down Counter.
3 - bit Up/Down Ripple Counter

Clk = MQ' + M'Q


3 - bit Up/Down Ripple Counter
M Q Q' Clk
0 (up) 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 (down) 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

QQ'
M
1 1
1 1

Clk = MQ' + M'Q


BCD Ripple Counter (Decade Counter)

0 1

1
BCD Ripple Counter (Decade Counter)
Mod -10 Counter
BCD Dec
Q3 Q2 Q1 Q0
0 0 0 0 0
0 0 0 1 1
0 0 1 0 2
0 0 1 1 3
0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7
1 0 0 0 8
1 0 0 1 9

1 0 1 0 10
Mod-n(Modulus-n) Counters
 Mod-5 Counter – has 5 states.
000(0) 001(1) 010(2)  011(3) 
100(4)

Mod - 15 Counter - 15 states…. Max count - 14

Mod – 9 Counter – 9 states…. Max count - 8


Synchronous Counters

• How to design Synchronous Counters?

1. Decide the number of flip flops.


2. Excitation table of flip flop.
3. State diagram and circuit excitation table.
4. Obtain simplified equations using K map.
5. Draw the logic diagram.
2-bit Synchronous Up Counter
00  01  10  11
Qn Qn+1 J K
0 0 0 X
0 1 1 X
1 0 x 1
1 1 x 0

For Ja
Present state Next state f/f inputs b0 1
a Q
Q
Qa Qb Qa+ Qb+ Ja Ka Jb Kb 0 1
o o 0 1 o x 1 x x x
1
o 1 1 0 1 x x 1
1 0 1 1 x 0 1 x Ja = Qb
1 1 0 0 x 1 x 1 Ka = Qb
Jb = 1
Kb = 1
2-bit Synchronous Up Counter

Ja = Qb
Ka = Qb
Jb = 1
Kb = 1
3-bit Synchronous Up/Down Counter

Qn Qn+1 T

0 0 0

0 1 1

1 0 1

1 1 0
M QC QB QA QC+ QB+ QA+ TC TB TA
0 0 0 0 0 0 1 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 0 1 1 0 0 1
0 0 1 1 1 0 0 1 1 1
0 1 0 0 1 0 1 0 0 1
0 1 0 1 1 1 0 0 1 1
0 1 1 0 1 1 1 0 0 1
0 1 1 1 0 0 0 1 1 1
1 0 0 0 1 1 1 1 1 1
1 0 0 1 0 0 0 0 0 1
1 0 1 0 0 0 1 0 1 1
1 0 1 1 0 1 0 0 0 1
1 1 0 0 0 1 1 1 1 1
1 1 0 1 1 0 0 0 0 1
1 1 1 0 1 0 1 0 1 1
1 1 1 1 1 1 0 0 0 1
3-bit Synchronous Up/Down Counter
TA = 1
TB = M'QA + MQA'
TC = M'QBQA + MQB'QA'
QB QA
M QC
00 01 11 10
00
1

01 1
1
For TC 11
10 1
QB QA 00 01 11 10
M QC 1 1
00
1 1
01
1 1
For TB 11
1 1
10
3-bit Synchronous Up/Down Counter

TA = 1
TB = M'QA + MQA'
TC = M'QBQA + MQB'QA'
1. Design a 3-bit Synchronous Down Counter.
2. Design a 3-bit Synchronous Up Counter.
Ring Counter
• Special type of Counter.
• Output of last flip-flop is connected to
first flip-flop.
• No. of states = No. of flip-flops used.
• PR= 0; Q = 1 and CLR = 0; Q = 0
• Pre
Ring Counter
0 0 1 0
0 0 0 1 1 0 0
0
o 1 1 o 0 o 0 o

Direct i/p Q1 Q2 Q3 Q4
low 1 0 0 0
high 0 1 0 0
high 0 0 1 0
high 0 0 0 1
high 1 0 0 0
Johnson Counter
• Modified from Ring Counter.
• Twisted Ring Counter.
• No. of states = 2 x [No. of flip-flops used]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy