Part 4 · FSM & Control · Senior Prep
Binary encoding
State Encoding: Binary encoding.
Binary encoding
BINARY ENCODING
┌─────────┐ ┌──────────────┐ ┌─────────┐
│ inputs │ ──► │ fsm │ ──► │ outputs │
└─────────┘ │ mechanism │ └─────────┘
└──────────────┘
│
pitfalls / when-to-use
(binary-encoding)Smallest register count; usually good for area-constrained designs
Next-state and output decode can become deeper as state count grows
Good default for low-frequency control paths
Deep dive
This lesson deepens Binary encoding within fsm. Senior reviewers expect you to connect mechanism to controller/datapath, encoding, and multi-cycle protocols — 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: illegal states handled, outputs defined every state. Treat this lesson as building one paragraph of that story for your project documentation.
Architecture and signal flow
BINARY ENCODING
inputs ──► [fsm] ──► mechanism ──► outputs
│ │
state-encoding verify in sim + lintWorked example (Verilog/SystemVerilog)
Synthesizable pattern for this topic — simulate locally and compare against your reference.
typedef enum logic [2:0] {...} state_e;Step-by-step design procedure
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.
Timing and resource trade-offs
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 probesDebug checklist
Compare 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
Interview angle
Moore vs Mealy for timing-critical outputs?
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 scenarioPractice exercise
Extend the worked example for "Binary encoding": add one corner case, write a self-checking test, and document one intentional pitfall you avoided. Timebox: 30–45 minutes.
Key takeaways
Connect Binary encoding to controller/datapath, encoding, and multi-cycle protocols.
Spec → diagram → code → TB → lint is the default loop.
Document assumptions at block boundaries (width, signedness, latency).
Interview answers need mechanism + trade-off + example.
Common pitfalls
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.
Extended design scenario
Scenario for Binary encoding : UART TX baud error — measure bit period in TB vs spec.
Scenario resolution outline
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.
Additional simulation pattern
// FSM state trace gold file
// cycle,state_q,outputs — compare each transitionSynthesis and sign-off notes
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
Lab exercise (45–60 min)
Implement or extend the worked example for "Binary encoding". 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.
Further reading in this course
Next topics in Part: follow nav_order in sidebar.
Cross-part: timing ↔ sequential, CDC ↔ senior interview,
combinational ↔ foundations number systems.Extended design scenario
Scenario for Binary encoding : UART TX baud error — measure bit period in TB vs spec.
Scenario resolution outline
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.
Additional simulation pattern
// FSM state trace gold file
// cycle,state_q,outputs — compare each transitionSynthesis and sign-off notes
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
Lab exercise (45–60 min)
Implement or extend the worked example for "Binary encoding". 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.
Further reading in this course
Next topics in Part: follow nav_order in sidebar.
Cross-part: timing ↔ sequential, CDC ↔ senior interview,
combinational ↔ foundations number systems.Extended theory
FSMs are the executable spec for control. If the FSM is wrong, no amount of datapath optimization fixes functionality; if the FSM is right but wide, encoding and output registration fix timing.
For "Binary encoding", 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 reading guide
WAVEFORM NARRATIVE — Binary encoding
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 lastSecond worked example
Alternate pattern emphasizing debug, coverage, or integration:
// FSM coverage — visit every state
cover property (@(posedge clk) state == RUN);
cover property (@(posedge clk) state == ERROR);Comparison: naive vs production
NAIVE 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 commentAdditional interview questions
Explain Binary encoding 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?
Follow-up interview model answer
Q: What is the #1 mistake with Binary encoding?
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 eventHands-on lab part 2
Fork 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?
Sign-off evidence checklist
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