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

Ring Counter

EasyLogic CircuitBuild

State machines and multi-phase clock generators often require a single active pulse that circulates continuously. The ring counter provides this precise timing sequence by operating a shift register in a closed feedback loop.

Construct a 4-bit ring counter using D flip-flops. When init is 1, the circuit must synchronously load the initial state 1000 on the rising edge of clk. When init is 0, the register shifts its contents on every rising clock edge. The shift path must follow Q3 to Q0, Q0 to Q1, Q1 to Q2, and Q2 to Q3.

| init | clk | Q3 | Q2 | Q1 | Q0 | |--------|-------|------|------|------|------| | 1 | ↑ | 1 | 0 | 0 | 0 | | 0 | ↑ | 0 | 0 | 0 | 1 | | 0 | ↑ | 0 | 0 | 1 | 0 | | 0 | ↑ | 0 | 1 | 0 | 0 | | 0 | ↑ | 1 | 0 | 0 | 0 |

Constraints

  • Use exactly four D flip-flops.
  • Implement the synchronous initialization logic using multiplexers on the flip-flop data inputs.
  • Do not use pre-packaged counter or shift register modules.

Topics

State MachineCountersShift Registers

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