Part of Curriculum: Advanced SoC and Chiplet RTL (Module 1: Fixed Priority vs Round-Robin Arbitration)
View Full Roadmap →
Level 8 Easy 10 pts ✓ Solved

Fixed-Priority Arbiter

Combinational Design · combinational, encoder

Grant exactly one of four requesters at a time, always favoring the highest-index request when several arrive together.

Write a synthesizable Verilog module named top_module matching the ports below exactly.
📐 Circuit Schematic Diagram
req[3:0]grant[3:0]FIXED-PRIORITY ARBITDIGITAL HARDWARE BLOCK
⚡ Timing & Synthesizability Constraints

Timing Contract: Strict synchronous timing aligned to posedge clk or zero-delay combinational propagation.

RTL Constraints: Synthesizable Verilog-2001. No # delays in synthesizable RTL.

Concept: A fixed-priority arbiter is a nested-priority mux: check the highest-priority request first (req[3]), and only fall through to lower ones if it is idle. grant = req[3]?4'b1000:req[2]?4'b0100:req[1]?4'b0010:req[0]?4'b0001:4'b0000; guarantees only one grant bit is ever set, with bit 3 always winning ties.
NameDirWidthDescription
reqinput4Request lines, one per requester
grantoutput4One-hot grant, req[3] has highest priority
Expected Waveform (Golden Timing Contract)
Verilog-2001 / SV Saved
Font: |
// Click Run Tests (or press Ctrl+Enter) to compile your RTL and simulate against hidden testbenches.
Simulation Timing Diagram (VCD Waveform)
100%
No simulation waveform yet. Run tests to simulate and generate VCD traces.
No compilation run yet. Syntax warnings and elaboration messages will appear here.
No simulation output yet. Raw stdout from vvp will appear here.

RTL Problems / Level 8 · Combinational Design

What You Will Learn

By solving Fixed-Priority Arbiter, you will acquire core industry skills:

  • Synthesizable hardware modeling in standard Verilog-2001 / SystemVerilog.
  • Correct handling of interface port contracts, edge-triggered clocks, and active-low/high resets.
  • Simulation waveform interpretation and debugging using timing diagrams (VCD traces).
  • Architectural avoidance of timing violations, glitching hazards, and synthesis warnings.

Problem Statement & Requirements

Grant exactly one of four requesters at a time, always favoring the highest-index request when several arrive together.

Hardware design teams at leading semiconductor firms evaluate these exact port contracts, race-condition assertions, and corner cases during technical design reviews and ASIC engineer interviews.

Concept: A fixed-priority arbiter is a nested-priority mux: check the highest-priority request first (req[3]), and only fall through to lower ones if it is idle. grant = req[3]?4'b1000:req[2]?4'b0100:req[1]?4'b0010:req[0]?4'b0001:4'b0000; guarantees only one grant bit is ever set, with bit 3 always winning ties.

Port List & Interface Timing

The hidden testbench instantiates top_module. Module port names and bit-widths must match the interface contract exactly:

NameDirWidthDescription
reqinput4Request lines, one per requester
grantoutput4One-hot grant, req[3] has highest priority

Timing Constraints & Synthesizable RTL Rules

⚡ Synthesizable Implementation Guidelines

Timing Contract: Strict synchronous timing aligned to posedge clk or zero-delay combinational propagation.

Synthesis Constraints: Synthesizable Verilog-2001. No # delays in synthesizable RTL.

Starter RTL Code

module top_module(
  input  [3:0] req,
  output [3:0] grant
);

  // Your code here — grant the highest-index active request; grant=0 if no requests.

endmodule
Advertisement

Related RTL Problems in Level 8

  • Watchdog Timer — A timeout that fires unless it keeps getting "kicked" — the safety-net circuit that resets a hung system when its heartbeat stops arriving.
  • CRC-4 Generator — Compute the 4-bit CRC remainder of an 8-bit message using the CRC-4 (poly x⁴+x+1) bit-serial algorithm, entirely in combinational logic.
  • CRC-4 Checker — Recompute the CRC-4 remainder of a received message and compare it against the appended CRC field to flag transmission errors.

Frequently Asked Questions

What does Fixed-Priority Arbiter require?

Grant exactly one of four requesters at a time, always favoring the highest-index request when several arrive together. Implement it as Verilog module top_module matching the listed ports.

Is this design combinational or sequential?

Tags: combinational, encoder. If a clock signal is present in the port table, implement it as sequential logic; otherwise, use continuous assignments or combinational blocks.

How is my solution graded?

A hidden SystemVerilog testbench simulates your module in the cloud judge. You pass when all directed corner cases match the golden model and the VCD timing waveform matches the contract.

How does this challenge help with semiconductor interviews?

Technical interviewers at NVIDIA, Qualcomm, Apple, and Intel routinely ask candidates to code, debug, and explain the timing waveforms of Fixed-Priority Arbiter to assess real-world synthesizability and race-condition awareness.

Advertisement