CodiodeCodiode
Home
Problem Solving
Skill Tracks
My Assignments
Contests
Leaderboard
Community
Settings
Codiode/Problems/Sequential Logic

Mod-6 Counter: Self-Correction by Explicit Next-State Assignment

MediumLogic CircuitBuild

Mission-critical state machines cannot rely on undefined behavior for invalid states. The next-state logic for a fault-tolerant mod-6 counter must explicitly route any illegal state back to the reset state to prevent system lockup from single-event upsets.

The circuit computes the next state (D2, D1, D0) given the current state (Q2, Q1, Q0). The counter increments normally from 0 to 5. If the current state is 6 or 7, the next state must immediately evaluate to 0.

| Q2 | Q1 | Q0 | D2 | D1 | D0 | |------|------|------|------|------|------| | 0 | 0 | 0 | 0 | 0 | 1 | | 0 | 0 | 1 | 0 | 1 | 0 | | 0 | 1 | 0 | 0 | 1 | 1 | | 0 | 1 | 1 | 1 | 0 | 0 | | 1 | 0 | 0 | 1 | 0 | 1 | | 1 | 0 | 1 | 0 | 0 | 0 | | 1 | 1 | 0 | 0 | 0 | 0 | | 1 | 1 | 1 | 0 | 0 | 0 |

Constraints

  • Implement combinational logic only.
  • Route states 6 and 7 explicitly to state 0.
  • Do not use sequential elements.

Topics

countersstate-machinesfault-tolerance

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

This problem is part of Codiode Pro. The statement above is free to read.

Sign in to solveSee what Pro unlocks

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Related problems

  • 3-bit Ripple Counter from Toggle Flip-FlopsEasy
  • D Latch from a 2:1 MUXEasy
  • 2-bit Ring CounterEasy
  • T Flip-Flop from a D Flip-FlopEasy
  • Handshake Deadlock Due to Early ResetHard
  • Reconvergence of Individually Synchronized BitsHard
  • Debug: Asynchronous Clear GlitchHard
  • Clock Gate Enable Crossing DomainsHard

Browse all problems · Learning tracks