DescriptionQ853
Q853DesignDVASIC interview problem
Vote across redundant state monitors
TechniquesMajority voterFault toleranceComparison fabric
DifficultyEasy
TopicRTL Design
LanguageSystemVerilog
Requirements4 checkpoints
01
Problem
Sample five redundant multi-bit state codes and return the code that appears at least three times. If no strict majority exists, report an invalid result and return zero.
Example input and output
Use this case to check your interpretationInput
five sampled state codes=[3,5,3,3,5]Output
majority_valid=1; majority_code=3Explanation
Three complete codes equal 3, satisfying the strict majority without unsafe per-bit voting.
02
Requirements (4)
- Compare complete state codes rather than voting each bit independently.
- Require at least three identical entries out of five.
- Produce deterministic zero data when the sampled set has no strict majority.
- Treat a rising edge of check as one request, sample all five entries together, and pulse done once for the registered result.