Johnson counters are one of the most important applications of shift registers. They are created by connecting multiple flip-flops to one another (such that the output of one flip-flop is the input for another), and by connecting the complement of the output of the last flip-flop to the input of the first flip-flop.

For a mod 6 Johnson counter, 3 flip-flops are required. Recall that the number of flip-flops required for a Johnson counter is half the number of used states for that counter. Since a mod 6 Johnson counter can count up to 6 states, 3 flip flops will be required.

Like a ring counter, a Johnson counter is a synchronous counter, hence the clock needs to be in “ON” state for the state transitions can happen.

**Circuit Diagram :**

**Table :**

Combining the excitation table and the state table here for convenience.

**State Diagram :**

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- n-bit Johnson Counter in Digital Logic
- Difference between Straight Ring Counter and Twisted Ring Counter
- Mod 2 Ring Counter (with D flip-flop)
- Construct a DFA which accept the language L = {w | w ∈ {a,b}* and Na(w) mod 3 = Nb (w) mod 3}
- Ripple Counter in Digital Logic
- Amortized analysis for increment in counter
- Design counter for given sequence
- Differences between Synchronous and Asynchronous Counter
- Non-binary Counter in Digital Logic
- Synchronous Series Carry Counter
- Self Starting Counter
- Free Running Counter
- Ring Counter in Digital Logic
- Program to construct a DFA which accept the language L = {a
^{n}b^{m}| n mod 2=0, m≥1} - Construct a DFA which accept the language L = {a
^{n}b^{m}| n > =1, (m) mod 3 = 1}

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.