Design a mod-5 synchronous counter using J-Kflip-flops, Computer Engineering

What are synchronous counters? Design a Mod-5 synchronous counter using J-K Flip-Flops.

Ans.

Synchronous Counters: It means that all flip-flops are clocked concurrently. The clock pulses drive the clock input of each flip-flop together hence there is no propagation delay.

Mod-5 Counter Synchronous Counter: This have five counter states. The counter design table for such counter shows the three flip-flop and their states also (0 to 5 states), as in table (a), the 6 inputs needed for the three flip-flops. The flip-flop inputs needed to step up the counter from the current to the next state have been worked out along with the assist of the excitation table illustrated in the table.

 

Input

 

pulse

 

 

Count

Counter States

 

 

A          B          C

Flip-Flop Inputs

 

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

0             X

0             X                           X             1

5(0)

0           0          0

 

 

                                                             Table (a) counter Design Table for Mod-5 Counter

A flip-flop:  The first state is 0. This change to 1 after the clock pulses. Thus JA must be 1 and KA may be 0 or 1 (i.e. X ).

B flip-flop: The first state is 0 and this keeps unchanged after the clock pulse. Thus JB must be 0 and KB may be 0 or 1 (i.e. X)

C flip-flop: The state keeps unchanged. Thus Jc must be 0 and KC must be X. The flip-flop input values are entered in Karnaugh maps demonstrated in Table (b) [(i) (ii) (iii) (iv) (v) and (vi)] and a boolean expression is determined for the inputs to the 3-flip-flops and after that each expression is simplified. All the counter states have not been utilized; X's (don't) are entered to indicate un-utilized states. For each input the simplified expressions demonstrated under each map. At last, these minimal expressions for the flip-flop inputs are utilized to illustrate a logic diagram for the counter that is demonstrated in fig. (b).

664_Karnaugh Maps for MOD-5 Synchronous Counter.png

Table (b) Karnaugh Maps for MOD-5 Synchronous Counter

766_Logic Diagram of MOD-5 Synchronous Counter.png


Fig. (b) Logic Diagram of MOD-5 Synchronous Counter

Posted Date: 5/2/2013 8:45:33 AM | Location : United States







Related Discussions:- Design a mod-5 synchronous counter using J-Kflip-flops, Assignment Help, Ask Question on Design a mod-5 synchronous counter using J-Kflip-flops, Get Answer, Expert's Help, Design a mod-5 synchronous counter using J-Kflip-flops Discussions

Write discussion on Design a mod-5 synchronous counter using J-Kflip-flops
Your posts are moderated
Related Questions
Address symbol table is generated by the  (A) memory management software.  (B) assembler.  (C) match logic of associative memory.   (D) generated by operating system

What are single stage and multistage networks? Compare the strengths and weaknesses of each. OR List the major difference in single stage, two stages and three stage Netw

SSTF stands for ? Ans. Shortest-Seek-time-first scheduling.

There are various approaches to the classification of Computer Networks. One such classification is based on distance approach. Networks can be classified into LAN, WAN and MAN net

How does throwing and catching exceptions differ from using setjmp and longjmp? Ans) The throw operation calls the destructors for automatic objects instantiated as entry to th

List the steps needed to perform page replacement. The steps required to perform page replacement are: 1. Find out which page is to be removed from the memory. 2. Perfor

1. Create the following ADTs. (a) Write the constructor function makestk, predicate function emptystk and mutator functions pushstk and popstk: i. makestk returns a new stack

Security Analysis: Suppose you are a young securities analyst, working in a small brokerage firm. You have access to publicly available information relevant to valuation of th

What is a Turing Machine?  Turing machine is a simple mathematical model of a computer. TM has unlimited an unrestricted memory and is a much more accurate model of a general

advantages in nano program