RTL Problems / Level 2 · Combinational Design
What You Will Learn
By solving Min/Max Finder, 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
Find both the minimum and maximum of three unsigned bytes at once — the basic building block of any sorting network or range check.
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.
a and b first, then compare the winner against c. The min follows the mirror-image tree using <= instead of >=. Swapping which tree feeds which output — computing the max tree but wiring it to min_val, and vice versa — compiles fine and even passes on inputs where all three values happen to be equal, but is backwards everywhere else.Port List & Interface Timing
The hidden testbench instantiates top_module. Module port names and bit-widths must match the interface contract exactly:
| Name | Dir | Width | Description |
|---|---|---|---|
| a | input | 8 | First value |
| b | input | 8 | Second value |
| c | input | 8 | Third value |
| min_val | output | 8 | Smallest of the three |
| max_val | output | 8 | Largest of the three |
Timing Constraints & Synthesizable RTL Rules
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 [7:0] a,
input [7:0] b,
input [7:0] c,
output [7:0] min_val,
output [7:0] max_val
);
// Your code here — a 2-comparison tree for max, and the mirror-image tree for min.
endmodule
Related RTL Problems in Level 2
- D Flip-Flop — Positive-Edge-Triggered Storage — Implement a basic 1-bit positive-edge-triggered D flip-flop without reset.
- D Flip-Flop with Asynchronous Reset — Reset Behavior — Design a D flip-flop with active-low asynchronous reset (areset_n). Reset forces q to 0 immediately, independent of clk.
- D Flip-Flop with Synchronous Reset — Clocked Reset — Implement a D flip-flop with active-high synchronous reset (sync_rst). The reset takes effect only on the rising clock edge.
Connected EcrioniX Learning Resources
Accelerate your VLSI engineering knowledge with these curated learning materials:
Progress through step-by-step verified modules from fundamentals to advanced silicon design.
Benchmark your hardware knowledge across 10 semiconductor domains and receive study roadmaps.
Explore foundational circuit theory, waveform timing, and physical hardware implementation.
Frequently Asked Questions
What does Min/Max Finder require?
Find both the minimum and maximum of three unsigned bytes at once — the basic building block of any sorting network or range check. Implement it as Verilog module top_module matching the listed ports.
Is this design combinational or sequential?
Tags: combinational, comparator. 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 Min/Max Finder to assess real-world synthesizability and race-condition awareness.