For the FSM below, assume to start from state S0 and to use the indicated encoding. The following sequence of inputs are going to be selected one after the other at times t0, t1, t2, t3, and t4. Use the FSM to indicate the next state bits and output Y after each time point. t0 -> AB=00 t1 -> AB=10 t2 -> AB=11 t3 -> AB=11 t4 -> AB=01 Indicate your answer using 3 bits for each time point. For example, if AB=10 at time t0, your answer would be 101, where the first two bits are for the next state (10 -> S2) and the third bit is for the output value Y

Problem 1. Byte Stuffing Decode the following "raw" sequence of bits into bytes using HDLC decoding. 111110111001111101

The symbol £ is magnified and shown in Figure 1 with a grid superimposed. Figure 1 The image in Figure 1 is to be encoded and encrypted using the following steps: 1. Each of the five horizontal rows of the picture is encoded as a 5-bit binary number. White squares are encoded as Os and black squares as 1s. The horizontal rows are therefore encoded as: Row 1: 00110 Row 2: 01001 Row 3: 11100 Row 4: 01000 Row 5: 11110 2. Starting from the left, the first binary digit is multiplied by 16, the second by 8, the third by 4, the fourth by 2, and the fifth by 1. This will convert the 5-bit binary numbers to decimal numbers as shown below: Row 1: (0 x 16) + (0 × 8) + (1 × 4) + (1 × 2) + (0 × 1) = 0 + 0 +4+2+0 = 6. Row 2: (0 x 16) + (1 × 8) + (0 × 4) + (0 × 2) + (1 × 1) = 0 + 8 +0+0+1 = 9. Row 3: (1 x 16) + (1 × 8) + (1 × 4) + (0 × 2) + (0 × 1) = 16+8+4 + 0 + 0 = 28. Row 4: (0 x 16) + (1 × 8) + (0 × 4) + (0 × 2) + (0 × 1) = 0 + 8 +0+0+0= 8. Row 5: (1 x 16) + (1 × 8) + (1 × 4) + (1 × 2) + (0 × 1)…

Reset A/0 B/O So S1 B/O AB/1 A/0 A+ BI0 (3) Describe in words what the state machine in figure above does. Using one- hot encodings, complete a state transition table and output table for the FSM above. Write Boolean equations for the next state and output and sketch a schematic of the FSM.