CS470 Spring 2008
Lab Assignment 2
Due Feb 25, 11 PM
A synchronous sequential circuit is given by the state table below.
| Present St | Input | Next St | Output | ||
| A | B | X | A | B | Z |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
1. Obtain minimized implementation of the combinational part in form of boolean equations.
2. Build the circuit using Logisim.
3. Verify that for all combinations, the circuit works as intended.
Submit the logisim .circ file using RAMCT. The file should have your name and the boolean equations for DA, DB and Z typed in as text. Label all inputs, outputs, state variable and flipflop inputs.