Design a 4-bit counter that will count in the shown sequence based on value of input F. Use only three flip flops. Minimize the combinational parts of the design.
Oooh -- I LOVE this sort of problem -- but I simply don't have the time -- maybe I can noodle on it while watching TV this evening.
Question: Re your PDF, are you sure input F should feed into the right-hand block of combinatorial logic?
Question: If F changes from 0 to 1 or 1 to 0 in the middle of a sequence, are there any rules as to how we should transition from one sequence to the other?
This looks suspiciously like a homework problem...
The key to this is noticing that one bit in each sequence doesn't change.I'd recommend to design a 3-bit counter using the flip-flops then see what you have to do with combinitorial logic to get the desired result for each state of F.
I agree -- this does look like a homework problem -- at first I was excited because I thought it was going to be tricky, but as you say, it's just a 3-bit binary counter -- the combinatorial logic on the input just does the counter function. The combinatorial logic on the output is just a 2:1 multiplexer.