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

Counter Type Identification: Eliminate Possibilities by Bit-Change Count

MediumLogic CircuitAnalyze

Identifying an unknown counter's architecture from its output sequence is a standard debugging technique when reverse-engineering undocumented digital systems.

A logic analyzer captures an 8-state sequence from an unknown 3-bit counter. The sequence is 000, 001, 011, 010, 110, 111, 101, 100. This sequence repeats continuously.

Count the number of bits that change between each adjacent state. Use this bit-change profile to eliminate impossible counter topologies and identify the specific encoding scheme used by this hardware.

Constraints

  • The counter is a synchronous 3-bit state machine.
  • The sequence wraps around continuously from the final state back to the initial state.
  • Assume all flip-flops trigger on the same clock edge.

Topics

Gray CodeCountersState MachinesJohnson Counter

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