Lecture 10: Synchronous Sequential Circuits Design 1 ... - CS-CSIF

2.4.2.1. Assign binary codes to each state. Since we have seven states, we will need three DFF to represent thepossible states. We will have A, B, and C as the present state of the corresponding flip-flopsPresent StateBinary Present State Input Next State OutputCode A B C x A B C zi 000 0 0 0 0 0 0 1 0i 000 0 0 0 1 0 1 0 00 001 0 0 1 0 0 1 1 00 001 0 0 1 1 1 0 0 01 010 0 1 0 0 1 0 1 01 010 0 1 0 1 1 1 0 000 011 0 1 1 0 0 1 1 000 011 0 1 1 1 1 0 0 001 100 1 0 0 0 1 0 1 101 100 1 0 0 1 1 1 0 110 101 1 0 1 0 0 1 1 110 101 1 0 1 1 1 0 0 111 110 1 1 0 0 1 0 1 011 110 1 1 0 1 1 1 0 02.4.2.2. Create K-Map for each flip-flop based on input and present state.AABBABCAB00 01 11 1000 01 11 1000 01 11 1000 0 1 1 100 0 0 0 000 1 1 1 101 0 1 1 1Cx01 1 1 1 101 0 0 0 011 1 1 d 1CxCx11 0 0 d 011 0 0 d 010 0 0 d 010 1 1 d 110 1 1 d 1A = BC̅ + AC̅ +CxB = C̅x + Cx̅C= x̅2.4.2.3. Use derivations from the K-maps to design initial combinational circuit.2.4.2.4. Create a K-Map based on flip-flops to determine the output combinational circuit.zAB00 01 11 100 0 0 0 1C1 0 0 0 1z = AB2.4.3. Mealy model usually involves less circuitry, and does here.2.4.3.1. Just need two DFFs to remember previous bit and then XOR with input!