Skip to RTL questions

Part 3 · Synthesis and proof

Widths, parameterization, timing, and RTL evidence

Connect behavioral intent to inferred hardware, implementation pressure, corner cases, and the lint, simulation, assertions, CDC, and timing evidence that closes the design.

Reading path
3 of 3
Chapters
1
Practice links
8

Question indexPractice this reading path.

Open the exact selected question in the practice bank. Premium prompts remain access-gated.

8 practice links shown.

  1. Q162Reverse a physical bus at the lane boundaryCombinational · Easy
  2. Q168Count active lanes in a predicate maskCombinational · Easy
  3. Q006Vote across redundant state monitorsCombinational · Easy
  4. Q177Implement a parameterized binary-to-Gray converterCombinational · Easy
  5. Q781Count consecutive zeros with saturationSequential & FSM · Easy
  6. Q200Detect and recover an upset one-hot FSMSequential & FSM · Medium
  7. Q014Register a glitch-free decoded enableSequential & FSM · Easy
  8. Q191Pipeline a parameterized barrel rotatorDataflow & storage · Hard

RTL Hardware and evidenceSynthesis, timing, and proof

Finish every answer by naming the inferred hardware, implementation pressure, corner cases, and evidence.

Concept model

From behavioral contract to signoff evidence

01 · ContractLatency · II · ordering

Define when inputs are accepted and when results are observable.

02 · RTL structureState · datapath · memory

Make cycle boundaries and resource ownership explicit.

03 · ImplementationWNS · TNS · area · congestion

Read mapped hardware, not only behavioral simulation.

04 · ProofLint · sim · SVA · CDC · STA

Match each claim to the tool that can falsify it.

Evidence ruleEvery claim names its units, operating conditions, and supporting report or property.

Latency
accept → result cyclesTime for one transaction.
Initiation interval
cycles between acceptsSustained acceptance rate.
Throughput
f_clk / IIResults per second.
Implementation
WNS (ns) + areaReport FF, LUT, RAM, or gates.

A strong RTL answer connects the interface contract to state and datapath, then closes the loop with implementation and verification evidence.