Question about binary counter with jk flip-flops

  • Thread starter Thread starter James889
  • Start date Start date
  • Tags Tags
    Binary Counter
AI Thread Summary
To create a binary counter using JK flip-flops that counts 1, 3, 5, 7, 1, the excitation table is essential for determining the next state. The discussion emphasizes using Karnaugh maps to minimize the J and K inputs, raising a question about whether to record instances when J or K is zero or only when they are one. It is clarified that one can indeed ignore columns in the Karnaugh map that consist solely of don't care (X) or zero, as a one will eventually appear. Participants suggest solving specific problems to better understand the application of these concepts. The conversation highlights the importance of correctly interpreting the Karnaugh map for effective counter design.
James889
Messages
190
Reaction score
1
Hi,

Let's say i want to make a binary counter using jk-flip-flops that counts 1,3,5,7,1...

Then i'd use the excitation table for the jk-flip-flop to determine the next state.

The next step would be to use karnaugh-maps to minimize the j and k columns.

My question is: Do i need to record, in the karnaugh-maps, when j or k is zero or only when they are at logic 1 ?
 
Physics news on Phys.org
you won't get zero for both j and k.. You will have either "zero" or "one" or "dont care(X)"..
So therefore you can record k-map according to i/p's.. I hope you know, that we can pair,quad,octal "1" with "X".
 
jerin_007 said:
you won't get zero for both j and k.. You will have either "zero" or "one" or "dont care(X)"..
So therefore you can record k-map according to i/p's.. I hope you know, that we can pair,quad,octal "1" with "X".

Hi,

So if one column for either J or K turn out to have only don't care or zero, i can just ignore it?
 
You will get a 1 at some point for sure.. Try solving one problem!
I haven't encountered having only 0 or X situation.
 

Similar threads

Back
Top