Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Paths
  • Concept Map
  • How to Read the Diagrams
  • Part 0: What Is a Protocol?10
  • Part 1: Timing and Clocking11
  • Part 2: Encoding and Framing12
  • Part 3: Handshakes13
  • Part 4: Flow Control17
  • Part 5: Transactions19
  • Part 6: Concurrency and Performance17
  • Part 7: Ordering13
  • Part 8: Sharing and Arbitration12
  • Part 9: Deadlock and Liveness13
  • Part 10: Reliability and Recovery20
    • Error Models
    • Parity
    • Hamming Distance
    • CRC
    • ECC and SECDED
    • Forward Error Correction
    • Error Responses
    • Poison and Containment
    • ACK and NAK
    • Sequence Numbers
    • Replay Buffers
    • Go-Back-N or Selective Repeat
    • Idempotency and Safe Replay
    • Link-Level or End-to-End Protection
    • Error Classes and Reporting
    • Recovery and Degradation
    • Interface Protection and Safety
    • The Reliability Budget
    • Protocols Compared: Reliability and Recovery
    • Drills: Reliability and Recovery
  • Part 11: Bring-Up and Link Management10
  • Part 12: Power8
  • Part 13: Shared State and Coherence9
  • Part 14: Security and Isolation7
  • Part 15: Specifying and Verifying11
  • Part 16: Protocols Dissected17
  • Part 17: Capstones5
  • Part 18: Interview Preparation6
Loading lesson

‹Part 10: Reliability and Recovery
  1. Topics
  2. First Principles of Hardware Protocols
  3. Part 10: Reliability and Recovery
  4. Interface Protection and Safety

Part 10 · Reliability and Recovery · Principal (P)

Interface Protection and Safety

Protecting data is not enough when a flipped control signal can create or lose a whole transaction. Parity on control signals, duplicated checkers, and the concept of functional safety targets for hardware that must not fail dangerously.

On this page

    Note

    Level: Principal (P) · Answers: What if bits go wrong?

    Before this: Parity, Error Classes and Reporting

    An interface protects its data bus with ECC. A single upset flips the valid signal for one cycle. The receiver accepts a transfer that the sender never made, with whatever happened to be on the bus, and its ECC checks out perfectly, because the stale data was valid ECC-protected data. A one-bit error on a control wire did what no amount of data protection can prevent: it created a transaction out of nothing.

    How do you protect the signals that decide whether a transfer happens at all?

    The obvious answer, and why it breaks

    The obvious protection targets the data, because data is wide and most bits are data. But the handful of control signals (valid, ready, last, the address, the transaction type) decide what the data means. A flip on valid invents or loses a transfer; on ready, makes a sender believe a word was taken when it was not; on last, merges or splits packets; on an address bit, writes the right data to the wrong place. Data codes cannot see any of these.

    The idea: protect control as well as data

    Technique

    Protects

    How

    Parity or check bits on control signals

    Valid, ready, last, type, address

    Each group of control signals carries its own parity (or is covered with the data by one code); the receiver checks before acting

    Redundant encoding of key signals

    Valid and ready

    Send a signal and its complement, or two copies; disagreement is an error

    Duplicated checkers

    The checking logic itself

    Two independent checkers compare results; a fault in one is detected by the disagreement

    Lockstep logic

    Whole blocks

    Two copies run the same inputs in step; outputs are compared every cycle

    Watchdogs and protocol monitors

    Protocol state

    Detect impossible sequences (a transfer with no request, a response with an unknown tag)

    Data carries ECC; control signals in both directions carry their own parity; the receiver checks with duplicated logic so a fault in the checker is also caught.

    Functional safety at concept level

    In systems where a hardware fault could cause harm (cars, industrial control, medical devices), standards such as ISO 26262 set targets for how many faults the hardware must detect or control. Integrity levels run from ASIL A to ASIL D; for ASIL D, the single-point fault metric must reach at least 99%: of the faults that could directly cause a violation, at least 99% must be covered by a safety mechanism. Interface protection, duplicated checkers and lockstep are the hardware mechanisms that earn that coverage; the coverage itself is shown with fault-injection campaigns (the UVM course covers those).

    How real systems chose

    Where

    Protection

    Safety-rated interconnects and processors

    Parity or ECC on control and address as well as data, duplicated or lockstep logic, and protocol monitors.

    Standard interfaces

    Optional parity or check signals on control in some protocol versions; otherwise added around the interface by the integrator.

    What breaks

    The opening interface (illustrative) had ECC on data but nothing on valid. Fault injection for a safety assessment showed that flips on valid, ready and last together were a large share of all dangerous faults, despite being only three wires. Adding parity on the control group, and a monitor that flagged transfers with no matching request, raised the coverage enough to meet the target.

    Why this matters

    Principal lens. In a reliability or safety review, count control signals as first-class: list every signal whose corruption changes the number, order or destination of transactions, and name the mechanism covering each. Data ECC alone leaves the most dangerous wires unprotected. Where integrity levels apply, show coverage by fault injection against the target metric, not by argument alone.

    Interview

    Asked: "How do you protect valid and ready themselves?"

    Weak answer: With ECC on the data.

    Strong answer: Data ECC can't help: a flip on valid creates or loses a whole transfer, and the data it carries may be perfectly valid ECC data. So control gets its own protection: parity over the control group (valid, last, type, address) checked before the receiver acts, parity on ready in the other direction, sometimes redundant encoding like a signal plus its complement, and protocol monitors that flag impossible events like a transfer nobody requested. For safety-rated designs the checkers themselves are duplicated, and coverage is shown by fault injection against targets like ISO 26262's single-point fault metric.

    Follow-ups: (1) What does a flip on ready do? (2) What is the single-point fault metric?

    Check yourself A flip on last in a packet stream. What can go wrong?

    Two packets are merged into one, or one is split into two: the receiver's framing is wrong even though every data word is correct.

    Check yourself Why duplicate the checker?

    So that a fault in the checking logic itself is detected by disagreement between the two checkers, rather than silently disabling the protection.

    Key takeaways

    • Control signals decide whether, where and how many transfers happen; data codes cannot see their errors.

    • Protect control with parity or redundant encoding, monitor protocol state, and duplicate checkers where it matters.

    • Safety standards set coverage targets (for example 99% single-point fault coverage at ASIL D), shown by fault injection.

    Keep going

    Next: Lesson 10.18, The Reliability Budget. From bit error rate to replay rate, latency and undetected errors: a worked budget.

    Related topics

    • Part 10 overview: Reliability and Recovery

    Previous

    158 / 234

    Next: The Reliability Budget

    Up next

    Up nextThe Reliability Budget

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • Error Models
    • Parity
    • Hamming Distance