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

Counter: K-Map Don't-Care Resolves to Lockup

HardLogic CircuitAnalyze

State-machine lockup occurs when unmapped states resolve to self-looping conditions under power-on or noise events. A 3-bit mod-5 counter sequences through valid states 000 through 100. States 101 (5), 110 (6), and 111 (7) are initially treated as don't-cares during K-map minimization to simplify the logic.

The synthesized next-state logic for the most significant bit is given by the expression D2 = Q2 Q1 + Q2 Q0. The logic for the lower bits evaluates to D1 = 1 and D0 = 0 if the machine enters state 6 (110).

Trace the next-state evaluation for the unused states. Identify the K-map grouping that caused the hazard and determine the modification required to force a safe recovery.

Constraints

  • Q2 is the most significant bit (MSB) and Q0 is the least significant bit (LSB).
  • Valid states are 000 through 100.
  • States 101, 110, and 111 are initially treated as don't-cares (X).
  • Assume standard sum-of-products boolean evaluation.

Topics

k-maphazardscountersstate-machine

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