KEY TAKEAWAYS
┌─────────┐ ┌──────────────┐ ┌─────────┐
│ inputs │ ──► │ combinational │ ──► │ outputs │
└─────────┘ │ mechanism │ └─────────┘
└──────────────┘
│
pitfalls / when-to-use
(key-takeaways)Full adders are the atom of most arithmetic datapaths.
Carry strategy determines adder speed more than XOR/AND gate count.
Wallace-tree style reduction is a key idea for fast multipliers.
This lesson deepens Key takeaways within combinational. Senior reviewers expect you to connect mechanism to logic depth, latch inference, and arithmetic width — not just define terms.
Start from the spec invariant: what must always be true each cycle? Write it as a Boolean relation, timing budget, or protocol rule before coding. That invariant becomes your reference model, assertion, or waveform check.
At tape-out quality, every block needs a sign-off story: no latches, ref model matches, delay intuition documented. Treat this lesson as building one paragraph of that story for your project documentation.
KEY TAKEAWAYS
inputs ──► [combinational] ──► mechanism ──► outputs
│ │
arithmetic verify in sim + lintSynthesizable pattern for this topic — simulate locally and compare against your reference.
wire [8:0] sum = a + b; // widen for carry
wire [15:0] prod = a * b;Write the spec invariant (truth table, timing, or protocol rule).
Sketch block diagram — inputs, outputs, clock/reset domains.
Code the minimal correct version (no optimizations yet).
Run self-checking TB with corners: min, max, reset, idle.
Lint and review: width, latch, clock, CDC if applicable.
Iterate for timing/area only after functionally proven.
METRIC TYPICAL LEVER
Logic levels algebra / pipelining
Register count retiming / sharing
Wire fanout duplication / pipeline
Power clock gating / operand isolation
Debug visibility status flags / SVA / waveform probesCompare DUT vs reference on every stimulus vector
Capture first cycle of mismatch — not last
Log seed and plusargs for random regressions
Check reset release and clock alignment in TB
If waveform is ambiguous, add temporary assertions
How do you prove no latch was inferred?
MODEL ANSWER SKELETON
1. MECHANISM — one-sentence technical truth
2. MOTIVATION — why this structure vs alternatives
3. WHEN TO USE / SKIP — scope and assumptions
4. PITFALL — common junior mistake
5. EXAMPLE — Verilog or waveform scenarioExtend the worked example for "Key takeaways": add one corner case, write a self-checking test, and document one intentional pitfall you avoided. Timebox: 30–45 minutes.
Skipping reference model — passes wrong together with DUT.
Optimizing before correct — ECO cost goes up 10×.
Ignoring tool warnings — lint/CDC/STA warnings are technical debt.
Undocumented clock/reset domain — integration surprises.
Scenario for Key takeaways: Adder overflow must flag, not wrap. Widen, compare signs, expose sticky status to CSR.
Reproduce with minimal TB — one stimulus, one check.
Isolate failing cone (logic, FSM state, or bus beat).
Fix root cause — not symptom — in RTL or TB alignment.
Add regression test that fails without the fix.
Document invariant in comment or SVA for permanence.
// Exhaustive 3-input truth table
for (int a=0; a<2; a++)
for (int b=0; b<2; b++)
for (int c=0; c<2; c++)
check_ref(a,b,c);Elaborate clean — no OOM from unconstrained generate
Constraints cover all clocks and I/O delays
Cross-check RTL parameters vs integration top
Attach sim log + seed to code review
Implement or extend the worked example for "Key takeaways". Add two new test vectors that target different branches. Write a one-paragraph sign-off note covering function, corners, and what you would still verify in SoC context.
Next topics in Part: follow nav_order in sidebar.
Cross-part: timing ↔ sequential, CDC ↔ senior interview,
combinational ↔ foundations number systems.Scenario for Key takeaways: Adder overflow must flag, not wrap. Widen, compare signs, expose sticky status to CSR.
Reproduce with minimal TB — one stimulus, one check.
Isolate failing cone (logic, FSM state, or bus beat).
Fix root cause — not symptom — in RTL or TB alignment.
Add regression test that fails without the fix.
Document invariant in comment or SVA for permanence.
// Exhaustive 3-input truth table
for (int a=0; a<2; a++)
for (int b=0; b<2; b++)
for (int c=0; c<2; c++)
check_ref(a,b,c);Elaborate clean — no OOM from unconstrained generate
Constraints cover all clocks and I/O delays
Cross-check RTL parameters vs integration top
Attach sim log + seed to code review
Implement or extend the worked example for "Key takeaways". Add two new test vectors that target different branches. Write a one-paragraph sign-off note covering function, corners, and what you would still verify in SoC context.
Next topics in Part: follow nav_order in sidebar.
Cross-part: timing ↔ sequential, CDC ↔ senior interview,
combinational ↔ foundations number systems.Combinational cones set the raw MHz ceiling of a block. Before pipelining, quantify depth: each wide mux or carry chain adds delay that shows up as setup slack erosion at the next register boundary.
For "Key takeaways", the invariant you defend in review is: behavior matches spec under all legal input sequences, reset flows, and backpressure patterns—not just the happy path shown in introductory diagrams.
Write the invariant as a comment above the module or as an SVA property when possible. Future you (and formal tools) will treat it as the contract.
WAVEFORM NARRATIVE — Key takeaways
cycle 0: reset asserted, outputs safe/idle
cycle 1-2: reset held, clocks running
cycle 3: reset released, first legal inputs
cycle 4+: check output latency (N cycles)
mark FIRST mismatch cycle — not lastAlternate pattern emphasizing debug, coverage, or integration:
// Pipeline-style comb for timing (register inputs)
always_ff @(posedge clk) a_r <= a;
always_ff @(posedge clk) b_r <= b;
assign y = a_r & b_r; // shorter path from flopNAIVE APPROACH PRODUCTION APPROACH
quick hack, one sim vector self-checking TB + corners
ignore lint warnings zero new waivers
implicit widths explicit casts/parameters
undocumented latency latency in module header commentExplain Key takeaways to a verification engineer — what would they assert?
What breaks first at high frequency or low voltage?
What is your rollback plan if synthesis QoR is unacceptable?
How would you debug this block with only a 32-bit GPIO trace?
Q: What is the #1 mistake with Key takeaways?
A:
MECHANISM: [core rule in one line]
MOTIVATION: why teams care in tape-out
PITFALL: what juniors do wrong
EXAMPLE: one Verilog line or one waveform eventFork the worked example; add one assertion or SVA cover.
Inject a bug deliberately; confirm TB or assertion catches it.
Write 5-bullet PR description for your change.
Peer review: can a teammate enable the block without asking you?
Directed sim log attached (PASS, seed noted)
Lint report clean for touched files
If sequential: reset + clocking section in README
If bus-facing: protocol cheat sheet in module doc
If timing-critical: note expected critical path endpoint