1.draw The Circuit Diagram of A Mod-16 Asynchronous Counter and Explain Its Working With
1.draw The Circuit Diagram of A Mod-16 Asynchronous Counter and Explain Its Working With
MOD-16 for a 4-bit counter, (0-15) making it ideal for use in Frequency
Division applications. But it is also possible to use the basic asynchronous
counter configuration to construct special counters with counting states less
than their maximum output number. For example, modulo or MOD
counters.
This is achieved by forcing the counter to reset itself to zero at a pre-
determined value producing a type of asynchronous counter that has
truncated sequences. Then an n-bit counter that counts up to its maximum
modulus ( 2n ) is called a full sequence counter and a n-bit counter whose
modulus is less than the maximum possible is called a truncated counter.
But why would we want to create an asynchronous truncated counter that
is not a MOD-4, MOD-8, or some other modulus that is equal to the power
of two. The answer is that we can by using combinational logic to take
advantage of the asynchronous inputs on the flip-flop.
If we take the modulo-16 asynchronous counter and modified it with
additional logic gates it can be made to give a decade (divide-by-10)
counter output for use in standard decimal counting and arithmetic circuits.
Such counters are generally referred to as Decade Counters. A decade
counter requires resetting to zero when the output count reaches the
decimal value of 10, ie. when DCBA = 1010 and to do this we need to feed
this condition back to the reset input. A counter with a count sequence from
binary “0000” (BCD = “0”) through to “1001” (BCD = “9”) is generally
referred to as a BCD binary-coded-decimal counter because its ten state
sequence is that of a BCD code but binary decade counters are more
common.
Clock Decimal
Count Value
QD QC QB QA
1 0 0 0 0 0
2 0 0 0 1 1
3 0 0 1 0 2
4 0 0 1 1 3
5 0 1 0 0 4
6 0 1 0 1 5
7 0 1 1 0 6
8 0 1 1 1 7
9 1 0 0 0 8
10 1 0 0 1 9
By using the same idea of truncating counter output sequences, the above
circuit could easily be adapted to other counting cycles be simply changing
the connections to the inputs of the NAND gate or by using other logic gate
combinations.
So for example, a scale-of-twelve (modulo-12) can easily be made by
simply taking the inputs to the NAND gate from the outputs at “QC” and
“QD“, noting that the binary equivalent of 12 is 1100 and that output “QA” is
the least significant bit (LSB).
Since the maximum modulus that can be implemented with n flip-flops is 2n,
this means that when you are designing truncated asynchronous counters
you should determine the lowest power of two that is greater than or equal
to your desired modulus.
Lets say we wish to count from 0 to 39, or mod-40 and repeat. Then the
highest number of flip-flops required would be six, n = 6 giving a maximum
MOD of 64 as five flip-flops would not be enough as this only gives us a
MOD-32.
Now suppose we wanted to build a “divide-by-128” counter for frequency
division we would need to cascade seven flip-flops since 128 = 27. Using
dual flip-flops such as the 74LS74 we would still need four IC’s to complete
the circuit.
One easy alternative method would be to use two TTL 7493’s as 4-bit
ripple counter/dividers. Since 128 = 16 x 8, one 7493 could be configured
as a “divide-by-16” counter and the other as a “divide-by-8” counter. The
two IC’s would be cascaded together to form a “divide-by-128” frequency
divider as shown.
Of course standard IC asynchronous counters are available such as the
TTL 74LS90 programmable ripple counter/divider which can be configured
as a divide-by-2, divide-by-5 or any combination of both. The 74LS390 is a
very flexible dual decade driver IC with a large number of “divide-by”
combinations available ranging form divide-by-2, 4, 5, 10, 20, 25, 50, and
100.