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

FIFO Almost Full Warning Logic

MediumLogic CircuitBuild

High-speed data links and streaming processors rely on flow control to prevent data loss. A FIFO almost-full flag provides critical lead time for an upstream transmitter to pause traffic before the buffer overflows.

The circuit evaluates the current 3-bit read pointer (rd_ptr) and 3-bit write pointer (wr_ptr) of an 8-entry circular buffer. The almost_full output must assert high exactly when the write pointer is two slots away from catching up to the read pointer. Because the buffer is circular, this calculation must account for modulo-8 wraparound.

| rd_ptr | wr_ptr | almost_full | |----------|----------|---------------| | 2 | 0 | 1 | | 3 | 0 | 0 | | 1 | 7 | 1 | | 0 | 6 | 1 |

Constraints

  • Combinational logic only.
  • Do not use any sequential elements or clocks.

Topics

arithmeticdatapathpointers

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