All numbers. The ones not in your sequence will be don't cares which can simplify the logic.In my trasition table did i need to present all numbers from 0 to 15 or just my sequence.
Yes, you only need four states and it only has to be a bi-directional counter (which you said you know how to make). It's generally worthwhile to find ways to turn something you need to do into something you already know how to do. Which is not to say that such a solution is always the best solution -- but it's worth considering. So it might be worth giving some thought about how you might take a two-bit output and produce the specific four four-bit output values you need.4
In first guestion i ask if i need truth table from 0 to 15, or just my sequnce.
Yes, but you only showed data for K=0. Add the data for K=1, make the Kmaps, and determine the minterms.You mean something like this
This is first situation where k is 1
Yes, you only need four states and it only has to be a bi-directional counter (which you said you know how to make). It's generally worthwhile to find ways to turn something you need to do into something you already know how to do. Which is not to say that such a solution is always the best solution -- but it's worth considering. So it might be worth giving some thought about how you might take a two-bit output and produce the specific four four-bit output values you need.
Uh... Both are LO, The first is LO and the second is HI, the first is HI and the second is LO, Both are HI.How two flip flops, we have state with four bits.
What is different about a counter that goes (0, 1, 2, 3), one that goes (13, 6, 8, 11), one that goes (H, R, O, Q), and one that goes (Bob, Sue, Tom, Jenny)?I'm talking about first example, not about this.
Suppose one needed a 4-color state machine (blue, red, yellow, green) but it was easier to design a state machine with various shades of pink. Then one could just say that pink represents blue, dark pink = red, light pink = yellow, & pale pink = green. But what if the requirement is to see the actual colors? Then one could feed the pink shades into a color changer to get the proper blue, red, yellow, and green colors. Or one could design a state machine capable of producing a broad range of colors, but limit it to selecting only the blue, red, yellow, and green colors (and all the other possible colors would be don't-care colors).In each case you need four states.
That's covered by Post #10. The TS was going down a rabbit hole (albeit one that would lead to a valid solution) by assigning the number of states based on the value the state represents instead of the number of values that need to be represented. Taking your last example (which is basically the same thing), if we use 24-bit colors, then that approach would require 24 flip flops to implement a four-state machine. Valid, but way too expensive on a number of fronts and also fraught with issues that have to be carefully addressed, such as trap states. Very seldom are unused states truly "don't cares" -- the term "don't care" would literally encompass anything, from the machine stalling in a whatever state it ended up in because of a stray cosmic ray upsetting one of the flip-flops to wandering endlessly in a seemingly random walk through the state space, to starting a global thermonuclear war; all of these are equally valid outcomes if we truly don't care.Suppose one needed a 4-color state machine (blue, red, yellow, green) but it was easier to design a state machine with various shades of pink. Then one could just say that pink represents blue, dark pink = red, light pink = yellow, & pale pink = green. But what if the requirement is to see the actual colors? Then one could feed the pink shades into a color changer to get the proper blue, red, yellow, and green colors. Or one could design a state machine capable of producing a broad range of colors, but limit it to selecting only the blue, red, yellow, and green colors (and all the other possible colors would be don't-care colors).