Design a mod-6 synchronous counter, Computer Engineering

Assignment Help:

Design a MOD-6 synchronous counter using J-K Flip-Flops.

Ans:

Design of Mod-6 Counter:  To design the Mod-6 synchronous counter, contain six counter states (that is, from 0 to 6). For this counter, the counter design table lists the three flip-flop and their states as 0 to 6 and the 6 inputs for the 3 flip-flops. The flip-flop inputs essential to step up the counter from the now to the next state is worked out along with the help of the excitation table.  The needed counter states and the J K inputs essential for counter flip- flops are specified in the counter design table demonstrated in Table no.1.

Input pulse

 

count

Counter States

 

Flip-Flop Inputs

 

A          B          C

 

JA

 

       KA

 

JB                KB

 

JC                  KC

0

0           0          0

1             X

0                 X

0                    X

1

1           0          0

X             1

1                 X

0                    X

2

0           1          0

1             X

X                 0

0                    X

3

1           1          0

X             1

X                 1

1                    X

4

0           0          1

1             X

0                 X

X                    0

5

1           0          1

X              1

0                 X

X                    1

6(0)

0           0         0

 

 

 

Table no.1: Counters Design Table for Mod-6 Counter

 Flip-Flop A:

The primary state is 0. This change to 1 after the clock pulses. Thus, JA must be 1 and KA may be 0 or 1 (that is X). In the subsequent state 1 change to 0 after the clock pulse.  Hence, JA may be 0 or 1 (that is, X) and KA must be 1.

Flip-Flop B:

The primary state is 0 and this remains unchanged after the clock pulse. Hence, JB   must be 0 and KB may be 0 or 1 (i.e. X). In the subsequent state 0 changes to 1 after the clock pulse. Hence, JB must be 1 and KB may be 0 or 1 (that is, X).

Flip-Flop C:

The primary state is 0 and this remains unchanged after the clock pulse. Hence JC must be 0 and KC may be 0 or 1 (that is, X). In the subsequent state, this remains unchanged after the clock pulse. Thus, JC must be 0 and KC may be 0 or 1 (that is, X).The JK inputs needed for such have been found with the help of the excitation table, (as in table no.1). The flip-flop input values are entered into Karnaugh maps demonstrated in Fig. a [(i), (ii), (iii), (iv), (v) and (vi)] and a Boolean expression is determined for the inputs to the three flip-flops and then all expressions are simplified. As all the counter states have not been utilized, Xs (don't) are entered to denote un-utilized states. The expressions that simplified for each input have been demonstrated under each map. At last, these minimal expressions for the flip-flop inputs are utilized to draw a logic diagram for the counter demonstrated in fig.(b).

As before, the JK inputs needed for this have been found with the help of the excitation table, (as in table no.1). Such input values are entered in Karnaugh maps Fig. (a)[i to vi] and a Boolean expression is determined for the inputs to the three flip-flops and then all expressions are simplified. Xs have been entered in that counter states that have not been utilized. The simplified expressions for all inputs have been demonstrated under each map and at last a logic diagram based upon these expressions is drawn and is demonstrated in fig.(b).

983_Karnaugh Maps for JA,KA,JB,KB,JC,KC.png

1325_Karnaugh Maps for JA,KA,JB,KB,JC,KC1.png

Fig.(b) Karnaugh Maps for JA,KA,JB,KB,JC,KC

1472_Logic Diagram for MOD-6 Synchronous Counter.png

Fig.(c) Logic Diagram for MOD-6 Synchronous Counter


Related Discussions:- Design a mod-6 synchronous counter

Write an algorithm for deadlock detection, Write an algorithm for deadlock ...

Write an algorithm for deadlock detection. An algorithm for deadlock detection: 1. Assume that Work and Finish be vectors of length m and n, correspondingly. Initialize:

Associative array processing, Associative Array Processing Consider tha...

Associative Array Processing Consider that a list of record or a table is stored in the memory and you want to search some information in that list. For example, the list havin

#MyLife, where should I work?

where should I work?

Fetching a word from memory - computer architecture, Fetching a word from m...

Fetching a word from memory: CPU transfers the address of the needed information word to the memory address register (MAR). Address of the needed word is transferred to the pr

What are the features common in most of the websites, What are the features...

What are the features common in most of the websites Following general features must be found on most web sites in one form or another (this list is by no means exhaustive):

Print a prompt, When your shell is waiting for input from the user, it shou...

When your shell is waiting for input from the user, it should first print a prompt. The prompt should consist of the current working directory followed by the _>_ character. Here i

Design a simple digital clock., Use a timer interrupt to design a easy digi...

Use a timer interrupt to design a easy digital clock.  This clock will count only minutes and seconds, and start at 00:00 every time your program starts.  The show on the screen sh

What is neg instruction, What is NEG instruction Arithmetic sign inver...

What is NEG instruction Arithmetic sign inversion or two's complement (NEG). NEG instruction two's complements a number which means that arithmetic sign of a signed number cha

Illustrate the term EDI trading patterns, Illustrate the term EDI Trading P...

Illustrate the term EDI Trading Patterns? EDI Trading Patterns are illustrated below: a. Hubs and Spokes: Several of the prime movers into the adoption of Electronic Da

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd