FSM "Short Cut Method"

[nfi]

Hello,

I'm not sure if this is the right forum for this, but I'll bludgeon on regardless until somebody says stop

I've been handed a "state transition" table for a finite state machine based on JK Flip-Flops and the associated Karnaugh maps generated from it. Each of the k-maps has an associated "circuit equation" of the form JA=QB.Q'C' KA=QB (for example).

I understand k-maps, but I simply can't follow these or the equations developed from them. A note states that they were generated using "the short-cut method" but I can't find anything relating to this method on the internet (unfortunately, I don't have any helpful books to hand at the moment).

As an example, here is one of the k-maps and the associated equation:

QA | QB QC
1 0 |
---------------
1 0 | 0 0
1 0 | 0 1
0 0 | 1 1
0 1 | 1 0

JA=QB.Q'C' KA=QB

The blue and red highlights represent two groupings drawn onto the table.

If anybody can explain the groupings to me or how the circuit equations were generated, it would be extremely helpful.

Thanks for reading all this

NFI

 

[IRstuff]

Is this for school?

TTFN

FAQ731-376

 

[nfi]

Yes and no...

I've been asked to look through an exam question for a training course, but I can't make head nor tail of it. I'm tempted to say this question doesn't make sense, but I thought I'd check to see if it was just something I hadn't come across before...

Thanks,

NFI

 

[IRstuff]

Doesn't look like there's enough information to figure out what's what.

> What do the two columns under QA refer to?

> With 3 outputs, there are 8 possible states, but only 4 are listed in the truth table.

TTFN

FAQ731-376

 

[nfi]

That's rather what I thought - no explanation is given...

Thanks for looking at it,

NFI