PPT Slide
7 – Sequential Logic Examples
Finite string pattern recognizer (step 1)
Finite string pattern recognizer
- one input (X) and one output (Z)
- output is asserted whenever the input sequence …010… has been observed, as long as the sequence 100 has never been seen
Step 1: understanding the problem statement
- sample input/output behavior: X: 0 0 1 0 1 0 1 0 0 1 0 … Z: 0 0 0 1 0 1 0 1 0 0 0 … X: 1 1 0 1 1 0 1 0 0 1 0 … Z: 0 0 0 0 0 0 0 1 0 0 0 …