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

T Flip-Flop: Divide-by-3 Counter Design

HardLogic CircuitBuild

Clock dividers in communication systems often require non-power-of-two ratios to generate specific baud rates or timing signals. A divide-by-3 counter provides a fundamental building block for these custom frequency synthesizers.

The circuit must sequence through the states 00, 01, and 10 on each rising edge of clk. If the circuit enters the invalid state 11 due to a glitch, it must recover by transitioning back to 00 on the next clock edge.

| Current Q1 | Current Q0 | Next Q1 | Next Q0 | |--------------|--------------|-----------|-----------| | 0 | 0 | 0 | 1 | | 0 | 1 | 1 | 0 | | 1 | 0 | 0 | 0 | | 1 | 1 | 0 | 0 |

Constraints

  • Use exactly two T flip-flops.
  • Implement combinational logic to derive the T inputs from the current state.
  • Ensure the invalid state 11 unconditionally transitions to 00 on the next clock edge.

Topics

State MachineT Flip-FlopCounters

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