DescriptionQ1101
Q1101DVASIC interview problem
Model a recent-ID replay stream
TechniquesDVSliding windowStream monitorReady/validCoverage
DifficultyHard
TopicReference Models
LanguageSystemVerilog
Requirements5 checkpoints
01
Problem
Verify a streaming detector that reports the first repeated transaction ID whose accepted positions differ by at most a configured distance K. Input gaps and output stalls must not affect the result.
Example input and output
Use this case to check your interpretationInput
K=2; accepted ID frame=[4,7,4] with idle gaps between transfers; stall the responseOutput
replay_found=1; first_index=0; second_index=2; stalled fields remain stableExplanation
Only accepted transfers define positions, and the repeated 4 has distance two, meeting the configured inclusive window.
02
Requirements (5)
- Accept one configuration before a nonempty frame, number only accepted ID transfers, and limit K to 15 and the frame to 16 IDs.
- Choose the lowest second index and then the lowest first index among pairs whose inclusive distance is at most K.
- Treat K zero as no replay and distinguish repeated IDs that lie outside the configured window.
- Compare only on an accepted response and require the stalled response payload to remain stable.
- Flush configuration, partial-frame state, and pending expectations on reset.