Part of Curriculum: Sequential RTL Design (Module 1: Sequential Design)
View Full Roadmap →
Level 3 Hard 50 pts ✓ Solved

Shift-Add Multiplier

Sequential Design · sequential, datapath

Multiply two unsigned 4-bit numbers using the classic shift-add algorithm — one bit of the multiplier examined per cycle, exactly how early CPUs implemented multiplication in hardware before dedicated multiplier arrays.

Write a synthesizable Verilog module named top_module matching the ports below exactly.
📐 Circuit Schematic Diagram
starta[3:0]b[3:0]product[7:0]doneMULTIPLIERDATAPATH
⚡ 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: Shift-add multiplication processes the multiplier one bit at a time: if the current LSB of the multiplier is 1, add the (progressively left-shifted) multiplicand into an accumulating product; either way, shift the multiplicand left and the multiplier right, and repeat for every bit. Forgetting to shift the multiplier means the same LSB is examined every cycle instead of advancing through the bits — the multiplicand still grows correctly, but the decision of when to add it is stuck testing the same (increasingly stale) bit forever.
NameDirWidthDescription
clkinput1Clock
rstinput1Sync active-high reset
startinput1Pulse for 1 cycle to begin multiplying a × b
ainput4Multiplicand
binput4Multiplier
productoutput8a × b, valid once done pulses
doneoutput1Pulses for 1 cycle when the product is ready
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 3 · Sequential Design

What You Will Learn

By solving Shift-Add Multiplier, 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

Multiply two unsigned 4-bit numbers using the classic shift-add algorithm — one bit of the multiplier examined per cycle, exactly how early CPUs implemented multiplication in hardware before dedicated multiplier arrays.

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: Shift-add multiplication processes the multiplier one bit at a time: if the current LSB of the multiplier is 1, add the (progressively left-shifted) multiplicand into an accumulating product; either way, shift the multiplicand left and the multiplier right, and repeat for every bit. Forgetting to shift the multiplier means the same LSB is examined every cycle instead of advancing through the bits — the multiplicand still grows correctly, but the decision of when to add it is stuck testing the same (increasingly stale) bit forever.

Port List & Interface Timing

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

NameDirWidthDescription
clkinput1Clock
rstinput1Sync active-high reset
startinput1Pulse for 1 cycle to begin multiplying a × b
ainput4Multiplicand
binput4Multiplier
productoutput8a × b, valid once done pulses
doneoutput1Pulses for 1 cycle when the product is ready

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  clk,
  input  rst,
  input  start,
  input  [3:0] a,
  input  [3:0] b,
  output reg [7:0] product,
  output reg done
);

  // Your code here — 4 iterations: if multiplier LSB is 1, add multiplicand into product; then shift multiplicand left, multiplier right.

endmodule
Advertisement

Related RTL Problems in Level 3

Frequently Asked Questions

What does Shift-Add Multiplier require?

Multiply two unsigned 4-bit numbers using the classic shift-add algorithm — one bit of the multiplier examined per cycle, exactly how early CPUs implemented multiplication in hardware before dedicated multiplier arrays. Implement it as Verilog module top_module matching the listed ports.

Is this design combinational or sequential?

Tags: sequential, datapath. 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 Shift-Add Multiplier to assess real-world synthesizability and race-condition awareness.

Advertisement